This year, the school is devoted to modern trends in obtaining conditional hardness results for algorithmic problems. In the school we will learn about new developments in complexity theory which allow to derive tight bounds on the time required to solve computational problems.
The lectures will be taught by the leading researchers in these areas. Each of the tutorials will provide an introduction to the area and gradually bring to the current research frontiers. The primarily audience consists of PhD students interested in Algorithms. Master students, postdocs, young researchers and even faculty are also very welcome. The school continues the Recent Advances in Algorithms 2017 school (video recordings of all the lectures are available at the school webpage).
The school is hosted by St. Petersburg Department of V.A. Steklov Institute of Mathematics of the Russian Academy of Sciences which is located in the very center of St. Petersburg. St. Petersburg is particularly beautiful in the late spring — early summer, the white nights season. The city is surrounded by wonderful tsar parks and palaces; an excursion to one of them will be a social program of the school.
The registration fee is 10000 RUR (approximately 140EUR or 176USD). The fee includes lectures, coffee breaks, excursion, and school dinner (but does not include lunches and accommodation). We will process the registrations on the first-come first-served basis and will close the registration form when the conference room is fully booked (around 80 participants).