Lecture Notes on Evasiveness of Graph Properties
Abstract
This report presents notes from the first eight lectures of the class Many Models of Complexity taught by Laszlo Lovasz at Princeton University in the fall of 1990. The topic is evasiveness of graph properties: given a graph property, how many edges of the graph an algorithm must check in the worst case before it knows whether the property holds.
 Publication:

arXiv eprints
 Pub Date:
 May 2002
 arXiv:
 arXiv:cs/0205031
 Bibcode:
 2002cs........5031L
 Keywords:

 Computer Science  Computational Complexity;
 F.1.3;
 F.2.0
 EPrint:
 Tech. Rep. CSTR31791, Computer Science Dept., Princeton University