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.
Power of one bit of quantum information.Phys
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A quantum-action-based quantization resolves inconsistencies in second-quantizing quantum time schemes by introducing spacetime classical mechanics and a no-go theorem, yielding manifestly covariant interacting QFT via a spacetime generalization of quantum states.
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.
-
From quantum time to manifestly covariant QFT: On the need for a quantum-action-based quantization
A quantum-action-based quantization resolves inconsistencies in second-quantizing quantum time schemes by introducing spacetime classical mechanics and a no-go theorem, yielding manifestly covariant interacting QFT via a spacetime generalization of quantum states.