Efficient Algorithms and Intractable Problems
Textbook: "Algorithms" — Papadimitriou, Dasgupta, & Vazirani
- 1 1. Big O Notation
- 2 2. Divide and Conquer
- 3 3. Decompositions of Graphs
- 4 4. Paths in Graphs
- 5 5. Greedy Algorithms
- 6 6. Dynamic Programming
- 7 7. Linear Programming and Reductions
- 8 8. NP-Complete Problems
- 9 9. Coping with NP-Completeness
- 10 10. Quantum Computing
- 11 11. Randomized Algorithms
- 12 12. Online Algorithms