[Home]History of Boolean satisfiability problem

HomePage | Recent Changes | Preferences
Revision 5 . . (edit) December 5, 2001 3:53 am by Ap [stubby article]
Revision 4 . . (edit) December 5, 2001 3:52 am by Ap [stubby article]
Revision 3 . . December 5, 2001 3:52 am by Ap [stubby article]
Revision 2 . . December 3, 2001 5:37 pm by (logged).99.218.xxx
Revision 1 . . December 3, 2001 5:36 pm by (logged).99.218.xxx
  
Difference (from prior major revision) (minor 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 f.
HomePage | Recent Changes | Preferences
Search: