Boolean satisfiability problem

HomePage | Recent changes | View source | Discuss this page | Page history | Log in |

Printable version | Disclaimers | Privacy policy

The binary satisfiability problem is an NP-Complete problem. Given a boolean decision function f(x1, x2, ..., xn), find the binary values for x1 though xn that satisfy f.