Prague Summer School on Discrete Mathematics 2020

External homepage

computational complexity discrete mathematics data structures and algorithms

Audience: Advanced learners
Conference dates: 24-Aug-2020 to 28-Aug-2020
Organizer: Jan Hladky*
*contact for this listing

Lecture series: *Subhash Khot: Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem *Shayan Oveis Gharan: Polynomial Paradigm in Algorithm Design

Upcoming talks
Past talks
Export series to