The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science


The SAT problem is the classical NP complete problem of searching for a satisfying assignment of a propositional formula in conjunctive normal form (CNF). General information on SAT can be found at or Our invited talk A Short History on SAT Solver Technology and What is Next? describes some of the new features of PicoSAT.
  • Download Files (local site)
  • Offical Site

    Problem Links

    Satisfiability (10)

    This page last modified on 2008-07-10 .