A duality between clause width and clause density for SAT

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 7-13

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; PROBLEM SOLVING; RANDOM VARIABLES; TIME DOMAIN ANALYSIS;

CLAUSE DENSITY; CONSTANT DENSITY; SPARSIFICATION LEMMA;

COMPUTATIONAL COMPLEXITY;

EID: 34247508205     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.6     Document Type: Conference Paper

References (18)

1. D. Achlioptas and C. Moore. The asymptotic order of the k-SAT threshold. Proc. 43rd IEEE Symposium on the Foundations of Computer Science, pages 779-788, 2002.
2. k In 2 - o(k). Proc. 35th Symposium on the Theory of Computing, pages 223-231, 2003.
3. M. Alekhnovich, E. A. Hirsch, and D. Itsykson. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Proc. 31st International Colloquium on Automata, Languages, and Programming, pages 84-96, 2004.
4. V. Arvind and R. Schuler. The quantum query complexity of 0-1 knapsack and associated claw problems. Proc. 14th International Symposium on Algorithms and Computation, pages 168-177, 2003.
5. P. Beame, R. Karp, T. Pitassi, and M. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. Proc. 30th Symposium on the Theory of Computing, pages 561-571, 1998.
6. C. Calabro, R. Impagliazzo, V. Kabanets, and R. Paturi. The complexity of unique k-SAT: an isolation lemma for k-CNFs. Proc. 18th IEEE Conference on Computational Complexity, pages 135-141, 2003.
7. R. Downey and M. Fellows. Fixed-parameter intractability. Structure in Complexity Theory Conference, pages 36-49, 1992.
8. J. Flum and M. Grohe. Parametrized Complexity Theory. Springer, 2006.
9. E. Friedgut. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc., 12:1017-1054, 1999.
10. A. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms, 20(2):312-355, 1996.
11. R. Impagliazzo and M. Paturi. Complexity of k-SAT. Proc. 14th IEEE Conference on Computational Complexity, pages 237-240, 1999.
12. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 653-662, 1998.
13. D. Johnson and M. Szegedy. What are the least tractable instances of max independent set? Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, pages 927-928, 1999.
14. S. Kirkpatrick and B. Selman. Critical behaviour in the satisfiability of random boolean expressions. Science, 264:1297-1301, 1994.
15. R. Paturi, P. Pudlak, M. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 628-637, 1998.
16. R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. Chicago Journal of Theoretical Computer Science, 1999. (preliminary version in FOCS'97).
17. U. Schoning. A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica, 32(4):615-623, 2002.
18. R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms, 54(1):40-44, 2005.