Počet záznamů: 1  

Prague Summer School on Discrete Mathematics 2020

  1. 1.
    SYSNO ASEP0539966
    Druh ASEPU - Uspořádání akce
    Zařazení RIVW - Uspořádání workshopu
    Zařazení RIVNení vybrán druh dokumentu
    NázevPrague Summer School on Discrete Mathematics 2020
    Tvůrce(i) Dvořák, Z. (CZ)
    Hladký, Jan (MU-W) RID, SAI, ORCID
    Druh akceW - Workshop
    Datum konání24.08.2020 - 28.08.2020
    Místo konáníPrague
    ZeměCZ - Česká republika
    Typ akceWRD
    Poč.účast.70
    Poč.účast.zahr.66
    Jazyk dok.eng - angličtina
    Klíč. slovatopology ; theoretical computer science ; graph theory
    Vědní obor RIVBA - Obecná matematika
    Obor OECDPure mathematics
    Institucionální podporaMU-W - RVO:67985840
    AnotaceSubhash Khot: Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem
    Computer scientists firmly believe that no algorithm can efficiently compute optimal solutions to a class of problems called NP-hard problems. For many NP-hard problems, even computing an approximately optimal solution remains NP-hard. This phenomenon, known as the hardness of approximation, has numerous connections to proof checking, optimization, combinatorics, discrete Fourier analysis, and geometry.
    Shayan Oveis Gharan: Polynomial Paradigm in Algorithm Design
    In this course we discuss the fruitful paradigm of encoding discrete phenomena in complex multivariate polynomials, and understanding them via the interplay of the coefficients, zeros, and function values of these polynomials. Over the last fifteen years, this perspective has led to several breakthroughs in computer science, and an unexpected bridge between seemingly distant scientific areas including combinatorics, probability, statistical physics, convex and algebraic geometry, and computer science has been built. In this course I plan to cover part of these developments with an emphasis on more recent developments specially connections to traveling salesman problem, matroids, high dimensional expanders and mixing time of random walks.
    PracovištěMatematický ústav
    KontaktJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Rok sběru2021
    Elektronická adresahttp://pssdm.math.cas.cz/2020
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.