New TFNP subclasses MHS (from Bézout's theorem) and SFTA (from the Fundamental Theorem of Algebra) are defined, and QSAT with SDR is proven MHS-complete.
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
New TFNP subclasses MHS (from Bézout's theorem) and SFTA (from the Fundamental Theorem of Algebra) are defined, and QSAT with SDR is proven MHS-complete.