182 citations · 670 across the 41 of their papers we have counts for
1 paper · 2 filters
Paul Beame, Trinh Huynh, Toniann Pitassi
We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems, tree resolution, into formulas that require…