2 search results - page 1 / 1 » Easily Refutable Subformulas of Large Random 3CNF Formulas |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
FOCS
2006
IEEE
13 years 8 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...