Hi all,

Just a reminder: this Thursday we will have next edition of "doktorandsky seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker will be Petr Chmel and he will talk about paper The Hardest Explicit Construction by Oliver Korten https://ieeexplore.ieee.org/document/9719750 https://arxiv.org/abs/2106.00875

Time: Thursday 9:50-12:10 Place: S8

Probabilistic method is a common technique to show the existence of interesting combinatorial objects by counting. Often, even in cases when we can compute that a majority of objects of certain type have a desirable property, it is still hard to explicitly construct one such object. This is the purpose of this paper, presented at FOCS'21. It uses methods of complexity, logic, randomness, etc. So, it will hopefully be interesting for everybody.

See you there,

R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University