[Home]Boolean satisfiability problem

HomePage | Recent Changes | Preferences
Difference (from prior minor revision) (major diff, author diff)

Changed: 1c1
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 the given function.
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.
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.
HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited December 5, 2001 3:53 am by Ap (diff)
Search: