Solving 3-satisfiability in less than 1, 579n steps

  • Ingo Schiermeyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 702)


In this paper we describe and analyse an improved algorithm for solving the 3-Satisfiability problem. If F is a boolean formula in conjunctive normal form with n variables and r clauses, then we will show that this algorithm solves the Satisfiability problem for formulas with at most three literals per clause in time less than O(1,579n).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Co]
    S. A. Cook, the Complexity of Theorem-Proving Procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York, 1971, 151–158.Google Scholar
  2. [GJ]
    M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.Google Scholar
  3. [MS]
    B. Monien and E. Speckenmeyer, Solving Satisfiability in less than 2 n Steps, Discrete Appl. Math. 10 (1985) 287–295.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ingo Schiermeyer
    • 1
  1. 1.Lehrstuhl C für MathematikTechnische Hochschule AachenAachenGermany

Personalised recommendations