CECS 528 Lectures

• NP Completeness (Annotated TuTh)
• NP Completeness (Annotated MW)
• NP Completeness
• Introduction to Complexity Theory (Annotated TuTh)
• Introduction to Complexity Theory (Annotated MW)
• Introduction to Complexity Theory
• Turing Reducibility and the Maximum Flow Algorithm
• Mapping Reducibility (Annotated TuTh)
• Mapping Reducibility (Annotated MW)
• Mapping Reducibility
• Dynamic Programming Algorithms (Annotated MW)
• Dynamic Programming Algorithms (Annotated TuTh)
• Dynamic Programming Algorithms
• Greedy Graph Algorithms (Annotated MW)
• Greedy Graph Algorithms (Annotated TuTh)
• Greedy Graph Algorithms
• Introduction to Greedy Algorithms (Annotated TuTh)
• Introduction to Greedy Algorithms (Annotated MW)
• Introduction to Greedy Algorithms
• Divide and Conquer Algorithms (Annotated TuTh)
• Divide and Conquer Algorithms (Annotated MW)
• Divide and Conquer Algorithms
• Computing Problems
• (Master Theorem) Example 2 of Recurrences Lecture
• Recurrences (Annotated TuTh)
• Recurrences (Annotated MW)
• Recurrences
• Review of Big-O Notation (Annotated TuTh)
• Review of Big-O Notation (Annotated MW)
• Review of Big-O Notation