Solving 3—Satisfiability in less than 1,579n Steps

  • Ingo Schiermeyer
Conference paper


In this paper we present and analyse an improved algorithm for solving the k-Satisfiability problem: Given a family F of r clauses in conjunctive normal form consisting of k literals corresponding to k different variables of a set of n boolean variables. Is F satisfiable?


  1. [1]
    B. Monien and E. Speckenmeyer, Solving Satisfiability in less than 2 n Steps, Discrete Appl. Math. 10 (1985) 287–295.CrossRefGoogle Scholar
  2. [2]
    I. Schiermeyer, Schnelle Algorithmen für das k-Satisfiability Problem, Habilitationsschrift, RWTH Aachen, 1992.Google 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