Easily refutable subformulas of large random 3CNF formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 519-530

  Feige, Uriel ^a   Ofek, Eran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

POLYNOMIAL-TIME ALGORITHMS; SUBFORMULAS;

POLYNOMIAL APPROXIMATION;

EID: 35048884715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_45     Document Type: Article

References (13)

1. E. Ben-Sasson and A. Wigderson. Short proofs are narrow-resolution made simple. Journal of the ACM (JACM), 48(2):149-169, 2001.
2. V. Chvatal and E. Szemeredi. Many hard examples for resolution. Journal of the ACM, 35(4):759-768, Oct 1988.
3. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schadlich. Certifying unsatisfiability of random 2k-sat formulas using approximation techniques. In Proc. of the 14th International Symposium on Fundamentals of Computation Theory, 2003.
4. U. Feige. Relations between average case complexity and approximation complexity. In Proc. of the 34th Annual ACM Symposium on Theory of Computing, pages 534-543, 2002.
5. U. Feige and E. Ofek. Spectral techniques applied to sparse random graphs. Technical report, Weizmann Institute of Science, 2003.
6. E. Friedgut and J. Bourgain. Sharp thresholds of graph properties, and the k-sat problem. JAMS: Journal of the American Mathematical Society, 12(4):1017-1054, 1999.
7. J. Friedman, A. Goerdt, and M. Krivelevich. Recognizing more unsatisfiable random 3-sat instances efficiently. Technical report, 2003.
8. A. Goerdt and M. Krivelevich. Efficient recognition of random unsatisfiable k-SAT instances by spectral methods. In STACS: Annual Symposium on Theoretical Aspects of Computer Science, pages 294-304, 2001.
9. A. Goerdt and A. Lanka. Recognizing more random 3-sat instances efficiently. Manuscript, 2003.
10. M. Hajiaghayi and G.B. Sorkin. The satisfiability threshold for random 3-SAT is at least 3.52. http://arxiv.org/abs/math.CO/0310193, 2003.
11. S. Janson, Y. C. Stamatiou, and M. Vamvakari. Bounding the unsatisfiability threshold of random 3-sat. Random Structures and Algorithms, 17(2):103-116, 2000.
12. A.C. Kaporis, L.M. Kirousis, and E.G. Lalas. Selecting complementary pairs of literals. In Proc. LICS'03 Workshop on Typical Case Complexity and Phase Transitions, June 2003.
13. U. Zwick. Outward rotations: a tool for founding 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, pages 679-687, 1999.