For every total Boolean function, the logs of exact and approximate De Morgan sparsity (and of exact and approximate l1 norm) are polynomially related up to a log n factor, resolving a 2021 conjecture.
Quantum lower bounds by polynomials
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis
For every total Boolean function, the logs of exact and approximate De Morgan sparsity (and of exact and approximate l1 norm) are polynomially related up to a log n factor, resolving a 2021 conjecture.