The complexity of AND—decomposition of Boolean functions

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	113-132
Number of pages	20
Journal	Discrete Applied Mathematics
Volume	280
DOIs	https://doi.org/10.1016/j.dam.2019.07.005
Publication status	Published - 15 Jun 2020

Computational complexity, Conjunctive decomposition, Disjoint decomposition, Polynomial factorization

ID: 21060242