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 there is an efficient refutation algorithm that for most formulas with cn clauses proves that they are not satisfiable. We present a polynomial time algorithm that for most 3CNF formulas with cn 3/2 clauses (where c is a large enough constant) finds a subformula with O(c 2 n) clauses and then proves that this subformula is not satisfiable (and hence that the original formula is not satisfiable). Previously, it was only known how to efficiently certify the unsatisfiability of random 3CNF formulas with at least poly(log(n)) · n 3/2 clauses. Our algorithm is simple enough to run in practice. We present some preliminary experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Sasson, E., Wigderson, A.: Short proofs are narrow-resolution made simple. Journal of the ACM (JACM) 48(2), 149–169 (2001)
Chvatal, V., Szemeredi, E.: Many hard examples for resolution. Journal of the ACM 35(4), 759–768 (1988)
Coja-Oghlan, A., Goerdt, A., Lanka, A., Schadlich, F.: Certifying unsatisfiability of random 2k-sat formulas using approximation techniques. In: Proc. of the 14th International Symposium on Fundamentals of Computation Theory (2003)
Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing, pp. 534–543 (2002)
Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Technical report, Weizmann Institute of Science (2003)
Friedgut, E., Bourgain, J.: Sharp thresholds of graph properties, and the k-sat problem. JAMS: Journal of the American Mathematical Society 12(4), 1017–1054 (1999)
Friedman, J., Goerdt, A., Krivelevich, M.: Recognizing more unsatisfiable random 3-sat instances efficiently. Technical report (2003)
Goerdt, A., Krivelevich, M.: Efficient recognition of random unsatisfiable k-SAT instances by spectral methods. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 294–304. Springer, Heidelberg (2001)
Goerdt, A., Lanka, A.: Recognizing more random 3-sat instances efficiently (2003) (manuscript)
Hajiaghayi, M., Sorkin, G.B.: The satisfiability threshold for random 3-SAT is at least 3.52 (2003), http://arxiv.org/abs/math.CO/0310193
Janson, S., Stamatiou, Y.C., Vamvakari, M.: Bounding the unsatisfiability threshold of random 3-sat. Random Structures and Algorithms 17(2), 103–116 (2000)
Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: Selecting complementary pairs of literals. In: Proc. LICS 2003 Workshop on Typical Case Complexity and Phase Transitions (June 2003)
Zwick, U.: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing, pp. 679–687 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feige, U., Ofek, E. (2004). Easily Refutable Subformulas of Large Random 3CNF Formulas. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive