CECS 528 Lectures

1. Randomized Algorithms (Annotated)
2. Randomized Algorithms
3. Approximation Algorithms (Annotated Friday)
4. Approximation Algorithms (Annotated Inapproximability of TSP and Christofides' Algorithm for Triangle-TSP)
5. Approximation Algorithms (Annotated)
6. Approximation Algorithms
7. NP Completeness (Annotated)
8. NP Completeness (Annotated Friday)
9. NP Completeness
10. Introduction to Complexity Theory (Annotated)
11. Introduction to Complexity Theory
12. Mapping Reducibility (Annotated Friday)
13. Mapping Reducibility (Annotated)
14. Mapping Reducibility
15. Logic Problems (Annotated)
16. Logic Problems (Annotated Friday)
17. Logic Problems
18. Dynamic Programming Algorithms (Annotated Friday)
19. Dynamic Programming Algorithms (Annotated)
20. Dynamic Programming Algorithms
21. Greedy Graph Algorithms (Annotated)
22. Greedy Graph Algorithms
23. Introduction to Greedy Algorithms (Annotated)
24. Introduction to Greedy Algorithms
25. Fast Fourier Transform (Annotated)
26. Fast Fourier Transform (Annotated Friday)
27. Divide and Conquer Algorithms (Annotated Friday )
28. Fast Fourier Transform
29. Divide and Conquer Algorithms (Annotated)
30. Divide and Conquer Algorithms
31. Recurrences (Annotated)
32. Recurrences
33. Review of Big-O Notation (Annotated)
34. Review of Big-O Notation (Annotated Friday)
35. Review of Big-O Notation