On 24.01.2013 at 12:20 in S8, there is the following noon lecture:
Optimization at the second level
The talk surveys and discusses a number of algorithmic problems located at the second level of the polynomial hierarchy. Most of these problems are taken from geometry, graph theory, social choice, and robust optimization; some of them are genuinely intractable, and some of them only pretend to be intractable.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010