Witnesses for non-satisfiability of dense random 3CNF formulas

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 497-506

  Feige, Uriel ^a   Kim, Jeong Han ^a   Ofek, Eran ^b  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

3CNF FORMULAS; POLYNOMIAL SIZE; SPECTRAL TECHNIQUES;

POLYNOMIALS; PROBLEM SOLVING; SPECTRUM ANALYSIS;

RANDOM PROCESSES;

EID: 38149139025     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.78     Document Type: Conference Paper

References (21)

1. N. Alon, M. Krivelevich and V. H. Vu. On the concetration of eigenvalues of random symmetric matrices. Israel J. Math. 131 (2002), 259-267.
2. N. Alon and J. Spencer. The Probabilistic Method, 2nd ed.. Wiley-interscience, New York, NY, 2000.
3. P. Beame, R. Karp, T. Pitassi and M. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. In Proceedings of 30th STOC, 561-571, 1998.
4. E. Ben-Sasson. Expansion in proof complexity. PhD thesis. Computer Science Department, Hebrew University, Jerusalem, Israel. 2001.
5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow-resolution made simple. Journal of the ACM (JACM), 48(2): 149-169, 2001.
6. V. Chvatal and E. Szemeredi. Many hard examples for resolution. Journal of the ACM, 35(4):759-768, Oct 1988.
7. C. Cooper, A. Frieze, M. Molloy, and B. Reed. Perfect Matchings in Random r-Regular, s-Uniform Hypergraphs, Combinatorics, Probability and Computing 5 (1996), 1-14.
8. P. Erdos and P. Tetali, Representations of integers as the sum of k terms, Random Structures & Algorithms, 1, (1990), 245-261.
9. 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.
10. U. Feige and E. Ofek. Spectral techniques applied to sparse random graphs. Random Structures and Algorithms, 27(2):251-275, 2005.
11. U. Feige and E. Ofek. Easily refutable subformulas of large random 3CNF formulas. In proceedings of ICALP 2004, 519-530.
12. U. Feige and E. Ofek. Random 3CNF formulas elude the Lovasz theta function. Technical Report MCS06-01, Computer Science and Applied Mathematics, Weizmann Institute of Science, 2006.
13. 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.
14. J. Friedman, A. Goerdt, and M. Krivelevich. Recognizing more unsatisfiable random 3-sat instances efficiently. Technical report, 2003.
15. J. Friedman, A. Goerdt, and M. Krivelevich. Recognizing more unsatisfiable random k-SAT instances efficiently. SIAM Journal on Computing, 35(2): 408-430, 2005.
16. Z. Furedi and J. Komlos. The Eigenvalues of Random Symmetric Matrices. Combinatorica, 1 (3) 233-241, 1981.
17. 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.
18. A. Goerdt and A. Lanka. Recognizing more random 3-sat instances efficiently. Manuscript, 2003.
19. 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.
20. S. Khot. Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. FOCS 2004, 136-145.
21. N. Wormald. Models of random regular graphs, Surveys in Combinatorics, 1999, J.D. Lamb and D.A. Preece, eds. London Mathematical Society Lecture Note Series, vol 276, pp. 239-298. Cambridge University Press, Cambridge, 1999.