Algorithmics and Computational Complexity

Randomized Algorithmics

basic information

prerequisitesobligatory: Basic knowledge of algorithm design and analysis
descriptionIntroduction into the mathematical and algorithmic foundations of algorithm design and analysis using the resource "random bits".
Particular topics are:
- randomized algorithms for graph problems and geometric problems
- the probabilistic method
randomized complexity classes
formLecture and tutorials
examination formoral examination
turnusThis course is not offered regularly

summer 2022

The course will not be offered in summer term 2022.

contact and links

offered in termteaching staff
WS 20/21Till Fluschnik, Hendrik Molter