1. subproblems
2. recurrences
3. pseudo-polynomial
4. computational intractability
5. NP class
6. NP-complete
7. boolean notation
8. 3-SAT
9. satisfying assignment
10. satisfiable clauses
11. strongly connected
12. mutually reachable
13. directed acyclic graph (DAG)

SAT

Given a set of clauses $C_1,\dots ,C_k$ over a set of variables $X=\{x_1,\dots ,x_n\}$ does there exist a satisfying truth assignment?

3-SAT

Given a set of clauses $C_1,\dots ,C_k$ each of length 3, over a set of variables $X=\{x_1,\dots ,x_n\}$, does there exist a satisfying truth assignment?