This new online event aims to integrate the European algorithmic community and keep it connected during the times of the pandemic. Nikhil Bansal (N&O) is one of the organizers.
Speaker: Karl Bringmann, Saarland University. Title: Fine-Grained Complexity of Optimization Problems
Abstract: Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on conjectures such as the Strong Exponential Time Hypothesis. This enables the design of "best-possible" algorithms, where the running time of the algorithm matches a conditional lower bound.
The meeting will be held using Airmeet platform and to attend
please go to https://www.airmeet.com/e/c5d58880-9240-11eb-974a-f53cdfe77b59. You can find more information about the talk on IGAFIT web page: http://igafit.mimuw.edu.pl/?page_id=483786.
In order to access Airmeet platform, you will need to register, so that others know who you are.
