Boolean satisfiability problem

The binary satisfiability problem is an NP-Complete problem. Given a boolean decision function f(x₁, x₂, ..., x_n), find the binary values for x₁ though x_n that satisfy f.