An efficient algorithm for the 3-satisfiability problem

This publication has 9 references indexed in Scilit:

• Algorithms for testing the satisfiability of propositional formulae
  The Journal of Logic Programming, 1989
• Some results and experiments in programming techniques for propositional logic
  Computers & Operations Research, 1986
• Solving satisfiability in less than 2n steps
  Discrete Applied Mathematics, 1985
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• Solving Satisfiability with Less Searching
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1984
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• On the Complexity of Timetable and Multicommodity Flow Problems
  SIAM Journal on Computing, 1976
• A Computing Procedure for Quantification Theory
  Journal of the ACM, 1960
• The Problem of Simplifying Truth Functions
  The American Mathematical Monthly, 1952