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
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Quantum algorithms reduce magic-square Diophantine detection to period finding via QFT and shifted oracles for structured solutions.
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.
-
Quantum Algorithms for Magic Square Diophantine Equations
Quantum algorithms reduce magic-square Diophantine detection to period finding via QFT and shifted oracles for structured solutions.