Forbes and Amir Shpilka , title =

Michael A · 2013 · DOI 10.1109/focs.2013.34

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.CC · 2026-05-06 · unverdicted · novelty 7.0

The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.

Showing 1 of 1 citing paper.

Hard CNF Instances for Ideal Proof Systems cs.CC · 2026-05-06 · unverdicted · none · ref 56
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.