Department of Computer Science | Institute of Theoretical Computer Science | CADMO

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 02, 2015, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Malte Milatz

The evasiveness conjecture

If P is some non-trivial monotone graph property, the evasiveness conjecture states that any deterministic algorithm to decide P must in the worst case query all the edges of the input graph.

In the 1980s the conjecture was proved for the case where the number of vertices is a prime power. In this talk we will have a look at this proof, so as to understand the role of that peculiar hypothesis.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

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


Automatic MiSe System Software Version 1.4803M   |   admin login