A set of clauses in conjunctive normal form.
Is there a truth assignment to the boolean variables
such that every clause is satisfied?
DIMACS Implementation Challenges (FORTRAN) (rating 8)
POSIT - Propositional Satisfiability Testbed (C) (rating 8)
Finite State Machine Minimization
Traveling Salesman Problem
Constrained and Unconstrained Optimization
Go to the corresponding chapter in the book
About the Book
Send us Mail
Go to Main Page
This page last modified on Tue Jun 03, 1997