13 citations · 27 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 1 cited
Improved Separations of Regular Resolution from Clause Learning Proof Systems
Maria Luisa Bonet, Sam Buss, Jan Johannsen
We prove that the graph tautology formulas of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned c…
cs.LO2012
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
Maria Luisa Bonet, Sam Buss
We prove that the graph tautology principles of Alekhnovich, Johannsen, Pitassi and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned…