Satisfiability
Input description: Given a boolean formula in conjunctive normal form
Problem description: Is there a truth assignment for the variables that causes the formula to evaluate to 1.
Special case where every clause is disjunction of exactly 3 literals also NP complete (called 3-SAT)
Example: digital design, hardware testing,….