Boolean satisfiability problem
Note that the unrestricted Boolean satisfiability problem is an NP-complete problem.