New IPS lower bounds via symmetry and lifting, including finite-field instances, plus a barrier theorem ruling out functional lower bounds for Boolean instances against strong proof systems.
A Lower Bound for Polynomial Calculus with Extension Rule
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
New IPS lower bounds via symmetry and lifting, including finite-field instances, plus a barrier theorem ruling out functional lower bounds for Boolean instances against strong proof systems.