Size-Space Tradeoffs for Resolution
Eli Ben‐Sasson · SIAM Journal on Computing · 2009
We investigate tradeoffs of various basic complexity measures such as size, space, and width. We show examples of formulas that have optimal proofs with respect to any one of these parameters, but optimizing one parameter must cost an increase in the other. These results have implications to the efficiency (or rather, inefficiency) of some commonly used SAT solving heuristics. Our proof relies on a novel connection of the variable space of a proof to the black-white pebbling measure of an underlying graph.