Refuting smoothed 3CNF formulas

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

Volumn , Issue , 2007, Pages 407-417

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CNF FORMULAS; SMOOTHING OPERATION; THRESHOLD VALUE(T);

CARBON NANOFIBERS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS;

BOOLEAN FUNCTIONS;

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

References (15)

1. N. Alon and J. Spencer. The Probabilistic Method, 2nd ed., Wiley-interscience, New York, NY, 2000.
2. N. Alon, K. Makarychev, Y. Makarychev, A. Naor. Quadratic forms on graphs. STOC 2005: 486-493.
3. N. Alon, A. Naor. Approximating the Cut-Norm via Grothendieck's Inequality. SIAM J. Comput. 35(4): 787-803 (2006).
4. A. Blum, J. Spencer. Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms 19(2): 204-234 (1995).
5. M. Charikar, A. Wirth. Maximizing Quadratic Programs: Extending Grothendieck's Inequality. FOCS 2004: 54-60.
6. A. Coja-Oghlan, A. Goerdt and A. Lanka. Strong Refutation Heuristics for Random k-SAT. In Proc. of the 8th International Workshop on Randomization and Computation, pages 310-321, 2004.
7. 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.
8. U. Feige, J. Kilian. Heuristics for Semirandom Graph Problems. J. Comput. Syst. Sci. 63(4): 639-671 (2001).
9. U. Feige, J. H. Kim, E. Ofek. Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS 2006: 497-508.
10. U. Feige and E. Ofek. Easily refutable subformulas of large random 3CNF formulas. In proceedings of ICALP 2004, 519-530.
11. U. Feige and D. Vilenchik. A local search algorithm for 3SAT. Technical report MCS04-07 of the Weizmann Institute, 2004.
12. J. Friedman, A. Goerdt, and M. Krivelevich. Recognizing more unsatisfiable random k-SAT instances efficiently. SIAM Journal on Computing, 35(2): 408-430, 2005.
13. 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.
14. A. Naor and J. Verstraete. Parity check matrices and product representaions of squares. Submitted for publication. A preliminary version appeared in IEEE ISIT 2005.
15. D. Spielman, S. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3): 385-463 (2004).