# Prague Summer School on Discrete Mathematics 2020

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

Your time | Speaker | Title | |||
---|---|---|---|---|---|

Fri | Aug 28 | 15:30 | Shayan Oveis Gharan | Polynomial Paradigm in Algorithm Design | |

Fri | Aug 28 | 14:00 | Subhash Khot | Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem | |

Thu | Aug 27 | 15:30 | Shayan Oveis Gharan | Polynomial Paradigm in Algorithm Design | |

Thu | Aug 27 | 14:00 | Subhash Khot | Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem | |

Wed | Aug 26 | 15:30 | Shayan Oveis Gharan | Polynomial Paradigm in Algorithm Design | |

Wed | Aug 26 | 14:00 | Subhash Khot | Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem | |

Tue | Aug 25 | 15:30 | Shayan Oveis Gharan | Polynomial Paradigm in Algorithm Design | |

Tue | Aug 25 | 14:00 | Subhash Khot | Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem | |

Mon | Aug 24 | 15:30 | Shayan Oveis Gharan | Polynomial Paradigm in Algorithm Design | |

Mon | Aug 24 | 14:00 | Subhash Khot | Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem |

Export series to