A new family of knapsack polynomials over finite fields requires super-polynomial-size refutations in constant-depth multilinear Ideal Proof System, with additional roABP lower bounds and a translation lemma toward CNF lower bounds.
Unsolvable systems of equations and proof complexity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lower Bounds against the Ideal Proof System in Finite Fields
A new family of knapsack polynomials over finite fields requires super-polynomial-size refutations in constant-depth multilinear Ideal Proof System, with additional roABP lower bounds and a translation lemma toward CNF lower bounds.