The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
The 2D HLF problem lies in QNC^0 but not in AC^0, with an exponential average-case correlation lower bound against AC^0 circuits.
citing papers explorer
-
Hard CNF Instances for Ideal Proof Systems
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
-
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
The 2D HLF problem lies in QNC^0 but not in AC^0, with an exponential average-case correlation lower bound against AC^0 circuits.