prov:value
| - Apparatus for solving the satisfiability problem as claimed in claim 20, wherein said combinational circuit is a model of a system of boolean equations of the form f1 (x1, x2, . . . , xn)=v1 f2 (x1, x2, . . . , xn)=v2 . . . fp (x1, x2, . . . ,xn)=vp where each fi (x1, x2, . . . , xn)=vi is a boolean expression and vi is a binary logic 0 or 1, said circuit further including decoder means receiving
|