Skip to main content
SpringerLink
Log in

Algorithms for Sat and Upper Bounds on Their Complexity

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worst-case upper bounds on their complexity. We also discuss some related issues: a derandomization of the algorithm of Paturi, Pudlák, Saks, and Zane, the Valiant–Vazirani lemma, and random walk algorithms with the “back button.” Bibliography: 47 titles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. S. Arora and C. Lund. “Hardness of approximation.” in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston (1997).

  2. R. Beigel. “Finding maximum independent sets in sparse and general graphs.” in: Proceedings of SODA’ 99 (1999), pp. 856–857.

  3. R. Beigel and D. Eppstein. “3-coloring in time O (1.3446 n ): a no-MIS algorithm.“ in: Proceedings of FOCS’ 95 (1995), pp. 444–452.

  4. A. Broder et al.. “Min-wise independent permutations.“ in: Proceedings of STOC’ 98 (1998), pp. 327–336.

  5. H. Buhrman and L. Fortnow. “Resource-bounded Kolmogorov complexity revisited.“ Lect. Notes Comp. Sci., 1200, 105–116 (1997).

    Google Scholar 

  6. S. Chari. “Randomness as a computational resource: issues in effcient computation.“ PhD thesis (1994).

  7. S. Chari, P. Rohatgi, and A. Srinivasan. “Improved algorithms via approximations of probability distribu-tions.“ J. Computer System Sci., 61, 81–107 (2000).

    Google Scholar 

  8. P. L. Chebyshev. “On prime numbers.“ in: Collected Papers [in Russian], Moscow (1955), pp. 33–54.

  9. E. Ya. Dantsin. “Two propositional proof systems based on the splitting method.“ J. Soviet Math., 22(3), 1293–1305 (1983).

    Google Scholar 

  10. E. Dantsin et al.. “Approximation algorithms for MAX SAT: a better performance ratio at the cost of a longer running time.“ Ann. Pure Appl. Logic, 113(1–3), 81–94 (2001).

    Google Scholar 

  11. E. Dantsin et al.. “A deterministic (2 – 2k +1 )n algorithm for k-SAT based on local search.“ Theor. Computer Sci. (2000) (to appear).

  12. E. Dantsin et al.. “Deterministic algorithms for k-SAT based on covering codes and local search.“ Lect. Notes Comp. Sci, 1853 (2000).

  13. M. Davis, G. Logemann, and D. Loveland. “A machine program for theorem-proving.“ Comm. ACM, 5(7), 394–397 (1962).

    Google Scholar 

  14. M. Davis and H. Putnam. “A computing procedure for quanti cation theory.“ J. ACM, 7(3), 201–215 (1960).

    Google Scholar 

  15. R. Fagin et al.. “Random walks with ‘back buttons'.“ in: Proceedings of STOC’ 2000 (2000), pp. 484–493.

  16. W. Feller, An Introduction to Probability Theory and Its Applications, Vol 1, Wiley (1968).

  17. J. Franco and A. Van Gelder. “A perspective on certain polynomial time solvable classes of satis ability.“ Discr. Appl. Math. (1998) (submitted).

  18. I. P. Gent and T. Walsh. “Towards an understanding of hill-climbing procedures for SAT.” in: Proceedings of AAAI-93 (1993), pp. 28–33.

  19. J. Gramm et al. “New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT.“ Electronic Colloquium on Computational Complexity, Technical Report 00–037 (2000).

  20. J. Gu, Algorithms for the Satisability Problem, Cambridge University Press (2000).

  21. S. Gupta. “On bounded-probability operators and C =P.“ Information Processing Letters, 48, 93–98 (1993).

    Google Scholar 

  22. E. A. Hirsch. “New worst-case upper bounds for SAT.” J. Automated Reasoning, 24(4), 397–420 (2000).

    Google Scholar 

  23. E. A. Hirsch. “Worst-case time bounds for MAX-k-SAT w. r. t. the number of variables using local search.“ in: Proceedings of RANDOM 2000 (2000), pp. 69–76.

  24. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag (1982).

  25. T. Itoh, Y. Takei, and J. Tarui. “On permutations with limited independence.“ in: Proceedings of SODA’ 2000 (2000), pp. 137–146.

  26. A. Kostrikin and Yu. Manin, Linear Algebra and Geometry, Gordon & Breach (1989).

  27. E. Koutsoupias and C. H. Papadimitriou. “On the greedy algorithm for satis ability.“ Information Processing Letters, 43(1), 53–55 (1992).

    Google Scholar 

  28. O. Kullmann. “Heuristics for SAT algorithms: Searching for some foundations.“ Discrete Appl. Math., (1998) (submitted).

  29. O. Kullmann. “New methods for 3-SAT decision and worst-case analysis.“ Theor. Computer Science, 223(1–2), 1–72 (1999).

    Google Scholar 

  30. O. Kullmann. “Investigations on autark assignments.“ Discrete Appl. Math., 107, 99–137 (2000).

    Google Scholar 

  31. O. Kullmann and H. Luckhardt. “Deciding propositional tautologies: algorithms and their complexity.“ preprint (1997).

  32. H. R. Lewis. “Renaming a set of clauses as a Horn set.“ J. ACM, 25(1), 134–135 (1978).

    Google Scholar 

  33. B. Monien and E. Speckenmeyer. “Solving satis ability in less then 2 n steps.“ Discrete Appl. Math., 10, 287–295 (1985).

    Google Scholar 

  34. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. “Matching is as easy as matrix inversion.“ Combinatorica, 7(1), 105–113 (1987).

    Google Scholar 

  35. R. Niedermeier and P. Rossmanith. “New upper bounds for Maximum Satis ability.“ J. Algorithms, 36, 63–88 (2000).

    Google Scholar 

  36. A. V. Naik, K. W. Regan, and D. Sivakumar. “Quasilinear time complexity theory.“ Theor. Computer Science, 148, 325–349 (1995).

    Google Scholar 

  37. R. Paturi et al.. “An improved exponential time algorithm for k-SAT.“ in: Proceedings of FOCS’ 98 (1998), pp. 628–637.

  38. R. Paturi, P. Pudlák, and F. Zane. “Satis ability coding lemma.“ in: Proceedings of FOCS’ 97 (1997), pp. 566–574.

  39. C. H. Papadimitriou. “On selecting a satisfying truth assignment.“ in: Proceedings of FOCS’ k91 (1991), pp. 163–169.

  40. C. H. Papadimitriou, Computational Complexity, Addison-Wesley (1994).

  41. J. M. Robson. “Algorithms for maximum independent set.“ J. Algorithms, 7, 425–440 (1986).

    Google Scholar 

  42. J. S. Schlipf et al.. “On nding solutions for extended Horn formulas.“ Information Processing Letters, 54(3), 133–137 (1995).

    Google Scholar 

  43. U. Schöning. “A probabilistic algorithm for k-SAT and constraint satisfaction problems.“ in: Proceedings of FOCS’ 99 (1999), pp. 410–414.

  44. B. Selman, H. Levesque, and D. Mitchell. “A new method for solving hard satis ability problems.“ in: Pro-ceedings of AAAI-92 (1992), pp. 440–446.

  45. S. Toda. “PP is as hard as the polynomial time hierarchy.“ SIAM J. Computing, 20(5), 865–877 (1991 ).

    Google Scholar 

  46. L. Valiant and V. Vazirani. “NP is as easy as detecting unique solutions.“ Theor. Computer Science, 47, 85–93 (1986).

    Google Scholar 

  47. M. Vsemirnov. “Automorphisms of projective spaces and min-wise independent families of permutations.” manuscript (2000).

Download references

Author information

Authors and Affiliations

  1. St.Petersburg Department of the, Steklov Mathematical Institute, Russia

    M. A. Vsemirnov, E. A. Hirsch, E. Ya. Dantsin & S. V. Ivanov

Authors
  1. M. A. Vsemirnov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. A. Hirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Ya. Dantsin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. V. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vsemirnov, M.A., Hirsch, E.A., Dantsin, E.Y. et al. Algorithms for Sat and Upper Bounds on Their Complexity. Journal of Mathematical Sciences 118, 4948–4962 (2003). https://doi.org/10.1023/A:1025645221773

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025645221773

Keywords

Search

Navigation