Lecture Notes on Evasiveness of Graph Properties
Computational Complexity
2015-06-02 v1
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.
Keywords
Cite
@article{arxiv.cs/0205031,
title = {Lecture Notes on Evasiveness of Graph Properties},
author = {Laszlo Lovasz and Neal E. Young},
journal= {arXiv preprint arXiv:cs/0205031},
year = {2015}
}
Comments
Tech. Rep. CS-TR-317-91, Computer Science Dept., Princeton University