Showing revision 3 Difference (from revision 3 to revision 3)
(minor diff, author diff) (The revisions are identical or unavailable.)
The binary satisfiability problem is an NP-Complete problem. Given a boolean decision function f(x1, x2, ..., xn<sub>), find the binary values for x<sub>1 though xn that satisfy the given function.