npycomp.problems

Implementations of various NP-complete problems.

NPyComp problems provides implementations of various NP-complete problems. Each problem in this module can be reduced to any other problem in this module.

Problems

SAT(clauses)	A Boolean Satisfiability (SAT) problem.
ThreeSAT(clauses)	A SAT Problem with at most three literals per clause.
Clique(A, k)	A clique problem.