Home / Computer science / Boolean satisfiability problem (SAT)
NP-complete with 3 or more literals per clause (3SAT).