Solving 3—Satisfiability in less than 1,579 n Steps
Ingo Schiermeyer · 1993
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?