Algorithms for four variants of the exact satisfiability problem

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 373-394

  Dahllöf, Vilhelm ^a   Jonsson, Peter ^a   Beigel, Richard ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b TEMPLE UNIVERSITY   (United States)

Author keywords

3 Satisfiability; Algorithm; Computational complexity; Counting; Counting models; Counting problem; Exact 3 satisfiability; Exact satisfiability; Exact solution; Exponential time algorithm; SAT; Satisfiability; X3SAT; XSAT

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

COUNTING PROBLEMS; EXACT SATISFIABILITY; EXPONENTIAL-TIME ALGORITHMS; SATISFIABILITY;

ALGORITHMS;

EID: 2442682120     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.035     Document Type: Article

References (36)

1. S. Baumer, R. Schuler, Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs, Electronic Coll. on Computational Complexity, vol. 10, 2003, ( ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/ TR03-010/index.html ).
2. R. Bayardo, J. D. Pehoushek, Counting models using connected components, Proc. 17th National Conf. AI and 12th Conf. on Innovative Applications of Artificial Intelligence, 2000, pp. 157-162.
3. R. Beigel, Finding maximum independent sets in sparse and general graphs, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 856-857.
4. n), ACM Computing Research Repository, June 2000, cs.DS/0006046.
5. Birnbaum E., Lozinskii E.L. The good old Davis-Putnam procedure helps counting models. J. Artif. Intell. Res. 10:1999;457-477.
6. V. Dahllöf, P. Jonsson, An algorithm for counting maximum weighted independent sets and its applications, Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 292-298.
7. n algorithm for k -SAT based on local search Theoret. Comput. Sci. 289:2002;69-83.
8. E. Dantsin, E.A. Hirsch, S. Ivanov, M. Vsemirnov, Algorithms for SAT and upper bounds on their complexity, Electronic Coll. on Computational Complexity, vol. 8, 2001, ( ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2001/TR01-012/ index.html ).
9. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
10. L. Drori, D. Peleg, Faster solutions for exact hitting set and exact SAT, Tech. Report MCS99-15, Mathematics & Computer Science, Weizmann Institute of Science, 1999.
11. Drori L., Peleg D. Faster solutions for some NP-hard problems. Theoret. Comput. Sci. 287:2002;473-499.
12. Dubois O. Counting the number of solutions for instances of satisfiability. Theoret. Comput. Sci. 81:1991;49-64.
13. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 329-337.
14. H. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proc. First ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 434-443.
15. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
16. Goldberg L., Jerrum M. Counting unlabelled subtrees of a tree is #P-complete. LMS J. Comput. Math. 3:2000;117-124.
17. Greenhill C.S. The complexity of counting colorings and independent sets in sparse graphs and hypergraphs. Comput. Complexity. 9:2000;52-72.
18. n/6.15 -time algorithm for x3sat Zapiski nauchnyh seminarov, POMI. 293:2002;118-128. (the English version can be found at the author's home page ( http://logic.pdmi.ras.ru/~kulikov/ )).
19. T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe, A probabilistic 3-SAT algorithm further improved, Proc. 19th Ann. Symp. on Theoretical Aspects of Computer Science, 2002, pp. 192-202.
20. Hunt III H.B., Marathe M.V., Radhakrishnan V., Stearns R.E. The complexity of planar counting problems. SIAM J. Comput. 27:1998;1142-1167.
21. K. Iwama, S. Tamaki, Improved upper bounds for 3-SAT ECCC TR03-053, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-053/index.html, 2003.
22. 0.304n) algorithm for solving maximum independent set problem IEEE Trans. Comput. 35:1986;847-851.
23. Kullmann O. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223:1999;1-72.
24. R. Motwani, K. Palem, V. Sarkar, S. Reyen, Combining register allocation and instruction scheduling, Tech. Report, Department of Computer Science, Stanford University, 1995.
25. R. Paturi, P. Pudlák, M. Saks, F. Zane, An improved exponential-time algorithm for k -SAT, Proc. 39th IEEE Symp. on Foundations of Computer Science, 1998, pp. 628-637.
26. n/5), Proc. Fifth Internat. Symp. on Theory and Appl. of SAT, 2002, pp. 231-235.
27. Robson J.M. Algorithms for maximum independent sets. J. Algorithms. 7:1986;425-440.
28. n/4), Tech. Report, LaBRI, Université Bordeaux I, 2001.
29. n)) - improving randomized local search by initializing strings of 3-clauses ECCC TR03-054, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-054/index.html, 2003.
30. Roth D. On the hardness of approximate reasoning. Artif. Intell. 82:1996;273-302.
31. Ryser H.J. Combinatorial Mathematics. 1963;The Mathematical Association of America, Washington.
32. Schöning U. A probabilistic algorithm for. k -SAT based on limited local search and restart Algorithmica. 32:2002;615-623.
33. Vadhan S.P. The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2):2001;398-427.
34. Valiant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.
35. Valiant L. The complexity of enumeration and reliability problems. SIAM J. Comput. 8:1979;410-421.
36. Zhang W. Number of models and satisfiability of sets of clauses. Theoret. Comput. Sci. 155:1996;277-288.