Sciweavers

MFCS
1997
Springer
13 years 11 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning