Computer science
- Computer science (CS)
- Decision problem
- Divide and conquer
- Recursion
- Base case
- Recursive case
- Merge sort
- Master theorem
- Generic search
- Depth-first search (DFS)
- Breadth-first search (BFS)
- Backtracking
- Pure function
- Memoization
- Dynamic programming
- Computational complexity
- Time complexity
- Elementary operation
- Space complexity
- Asymptotic complexity
- Big O
- Order of growth
- Hardness
- Complexity class
- P
- NP
- NP-complete
- NP-hard
- Graph coloring (COL)
- 3-coloring (3COL)
- Boolean satisfiability problem (SAT)
- Conjunctive normal form (CNF)
- 3-satisfiability (3SAT)
- SATLIB
- GSAT
- HSAT
- GWSAT
- TSAT
- WalkSAT (WSAT)
- Unsat
- Flip
- Optimization problem
- Maximization problem
- Minimization problem
- Optimal solution
- Optimal solution enumeration
- Set cover
- Set packing
- Zebra puzzle