Algorithmics and Computational Complexity
Algorithmics for Discrete Data Science
basic information
| level | advanced Master |
|---|---|
| prerequisites | obligatory: basic knowledge on algorithm design desirable: basic understanding of approximation and parameterized algorithmics; participation in the course Advanced Algorithmics |
| description | Algorithm design and analysis for the classical computation model as well as alternative models of computation. The various models (including RAM, memory hierarchy, online, streaming, etc.) are employed in several fundamental problem domains. These domains include: - Network analysis, - Sequence analysis, and - Matrix analysis. |
| LP | 6 |
| form | lecture and tutorials |
| examination form | written examination |
| turnus | this course is not offered regularly |