2 citations · 2 across the 1 of their papers we have counts for
1 paper
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…