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 www.satlive.org or www.satlib.org. 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
This page last modified on 2008-07-10