Objectives
The student will learn about advanced algorithmic techniques, including dynamic programming and network flows. The course also introduces NP-completeness and how to prove NP-completeness of a problem.
The student will learn about advanced algorithmic techniques, including dynamic programming and network flows. The course also introduces NP-completeness and how to prove NP-completeness of a problem.
- Peppi-Teacher: Csaba Raduly-Baka