Boolean satisfiability problem
HomePage

Recent Changes

Preferences
The
binary satisfiability problem
is an
NPComplete
problem. Given a boolean decision function
f(x
_{1}
, x
_{2}
, ..., x
_{n}
)
, find the binary values for
x
_{1}
though
x
_{n}
that satisfy
f
.