A spectral technique for random satisfiable 3CNF formulas

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 357-363

  Flaxman, Abraham ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

GRAPH COLORING; GREEDY ALGORITHM; RANDOM 3CNF FORMULAS; SPECTRAL ALGORITHM; SPECTRAL TECHNIQUE; TRUTH ASSIGNMENT;

SPECTRUM ANALYSIS;

EID: 0037739992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Alon and N. Kahale, A Spectral Technique for Coloring Random 3-Colorable Graphs, DIMACS TR-94-35 (1994).
2. N. Alon and J. Spencer, The Probabilistic Method, John Wiley & Sons (2000).
3. E. Ben-Sasson and A. Wigderson, Short proofs are narrow - Resolution made simple, J. Assoc. Comp. Mach. (1999) 517-526.
4. J. Crawford and L. Auton. Experimental results on the crossover point in random 3-SAT, Artificial Intelligence 81 (1996) 31-57.
5. H. Chen and A. Frieze, Coloring Bipartite Hypergraphs, Proc. 5th IPCO (1996) 345-358.
6. V. Chvátal and E. Szemerédi, Many hard examples for resolution, J. Assoc. Comp. Mach. (1988) 759-768.
7. S. Cook, The Complexity of theorem-proving procedures, Proc. 3rd FOCS (1971) 151-158.
8. U. Fiege, Relations between average case complexity and approximation complexity, Proc. 34th ACM STOC (2002).
9. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc. 12 (1999) 1017-1054.
10. J. Friedman and A. Goerdt, Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently, Proc. 28th ICALP (2001) 310-321.
11. J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs, Proc. 21st ACM STOC (1989) 587-598.
12. A. Kaporis, L. Kirousis, and E. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, Proc. 5th Satisfiability Testing Workshop (2002) 362-276.
13. A. Kaporis, L. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. Proc. 7th ICTCS (2001) 328-338
14. E. Koutsoupias and C. Papadimitriou, On the greedy algorithm for satisfiability, Info. Proc. Let., 43 (1992) 53-55.
15. L. Levin, Universal search problems, Prob. Info. Trans. 9 (1973) 265-266.
16. M. Motoki and R. Uehara, Unique Solution Instance Generation for the 3- Satisfiability (3SAT) Problem, IEICE Technical Report, COMP98-54 (1998) 25-32.
17. G. Strang, Linear algebra and its applications, Hard-court Brace Jovanovich Publishing (1988).