Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 68 (2004) 238268

Summary: http://www.elsevier.com/locate/jcss
Journal of Computer and System Sciences 68 (2004) 238268
A sharp threshold in proof complexity yields lower bounds for
satisfiability search
Dimitris Achlioptas,a
Paul Beame,b,,1
and Michael Molloyc,2
Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA
Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, USA
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A4
Received 31 December 2001; revised 18 April 2003
Let Frn; Dn denote a random CNF formula consisting of rn randomly chosen 2-clauses and Dn
randomly chosen 3-clauses, for some arbitrary constants r; DX0: It is well-known that, with probability
1 o1; if r41 then Frn; Dn has a linear-size resolution refutation. We prove that, with probability
1 o1; if ro1 then Frn; Dn has no subexponential-size resolution refutation.
Our result also yields the first proof that random 3-CNF formulas with densities well below the generally


Source: Achlioptas, Dimitris - Department of Computer Engineering, University of California at Santa Cruz


Collections: Computer Technologies and Information Sciences