A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
A sharp threshold in proof complexity
2001
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01
We give the first example of a sharp threshold in proof complexity. More precisely, we show that for any sufficiently small¯ ¼ and ¡ ¾ ¾ , random formulas consisting of´½ ¯µÒ 2-clauses and ¡Ò 3-clauses, which are known to be unsatisfiable almost certainly, almost certainly require resolution and Davis-Putnam proofs of unsatisfiability of exponential size, whereas it is easily seen that random formulas with´½ ·¯µÒ 2-clauses (and ¡Ò 3-clauses) have linear size proofs of unsatisfiability almost
doi:10.1145/380752.380820
dblp:conf/stoc/AchlioptasBM01
fatcat:tonk7hhnbffmxa6w2qdgaescmy