Boolean satisfiability problem

The binary satisfiability problem is an NP-Complete problem. Given a boolean decision function f(x₁, x₂, ..., x<sub>n₎, find the binary values for x<sub>1 though x_n that satisfy the given function.