Deciding circuit width w(f) ≤ k for degree-3 polynomials with no constant term is NP-complete, with 49/48-ε inapproximability, ETH lower bounds, and FPT algorithms.
Journal of Physics A: Mathematical and Theoretical , abstract =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Complexity of the Circuit Width Problem
Deciding circuit width w(f) ≤ k for degree-3 polynomials with no constant term is NP-complete, with 49/48-ε inapproximability, ETH lower bounds, and FPT algorithms.