The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
Hardness vs randomness
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
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.
-
An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.