The complexity of unique k-SAT: An isolation lemma for k-CNFs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 135-141

  Calabro, Chris ^a   Impagliazzo, Russell ^a   Kabanets, Valentine ^a   Paturi, Ramamohan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; POLYNOMIALS;

ISOLATION LEMMA;

COMPUTER SCIENCE; COMPUTATIONAL COMPLEXITY;

COUNCILS; ISOLATION LEMMATA; PARTICLE MEASUREMENT; RANDOMIZED ALGORITHMS; SATISFIABILITY PROBLEMS; SEARCH PROBLEM;

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

References (15)

1. [Coo71] S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
2. [Dan81] E. Dantsin. Two prepositional proof systems based on the splitting method. Zapiski Nauchnykh Seminarov LOMI, 105:24-44, 1981. (in Russian). English translation in Journal of Soviet Mathematics, 22(3): 1293-1305, 1983.
3. [Dan81] E. Dantsin. Two prepositional proof systems based on the splitting method. Zapiski Nauchnykh Seminarov LOMI, 105:24-44, 1981. (in Russian). English translation in Journal of Soviet Mathematics, 22(3): 1293-1305, 1983.
4. n algorithm for k-SAT based on local search. Theoretical Computer Science. to appear.
5. [GB97] E. Grandjean, H. Buning. SAT-problems and reductions with respect to the number of variables. Journal of Logic and Computation, 7(4):457-471, 1997.
6. [Har67] L.H. Harper. A necessary condition on minimal cube numberings. Journal of Applied Probability, 4:397-401, 1967.
7. [HSSW02] T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe. A probabilistic 3-SAT algorithm further improved. In Proceedings of the Nineteenth Annual Symposium on Theoretical Aspects of Computer Science, pages 192-202, 2002.
8. [IP01] R. Impagliazzo, R. Paturi. On the complexity of k-SAT. Journal of Computer and Systems Sciences, 62(2):367-375, 2001.
9. [IPZ98] R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? In Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science, pages 653-662, 1998.
10. n steps. Discrete Applied Mathematics, 10:287-295, 1985.
11. [PPSZ98] R. Paturi, P. Pudlák, M.E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science, pages 628-637, 1998.
12. [PPZ99] R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. Chicago Journal of Theoretical Computer Science, 1999. (preliminary version in FOCS'97).
13. [Sch02] U. Schöning. A probabilistic algorithm for kSAT based on limited local search and restart. Algorithmica, 32:615-623, 2002.
14. [Schuler03] R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. Technical Report, Universit at Ulm, 2003.
15. [VV86] L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986.