## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

# Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

 Mittagsseminar Talk Information

Date and Time: Thursday, April 26, 2001, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Krzysztof Pietrzak

## $opt=\overline{opt}$ is NP-complete; an $O(mn!n^3)$ Algorithm for the list update problem

An abstract is not available in the database

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996

Information for students and suggested topics for student talks