Lecture Notes on Evasiveness of Graph Properties
<|reference_start|>Lecture Notes on Evasiveness of Graph Properties: 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.<|reference_end|>
@article{lovasz2002lecture,
    title={Lecture Notes on Evasiveness of Graph Properties},
    author={Laszlo Lovasz, Neal E. Young},
    journal={arXiv preprint arXiv:cs/0205031},
    year={2002},
    number={Princeton University CS-TR-317-91},
    archivePrefix={arXiv},
    eprint={cs/0205031},
    primaryClass={cs.CC}
}