Corpus ID: 16644516

Lecture Notes on Evasiveness of Graph Properties

@article{Lovsz2002LectureNO,
  title={Lecture Notes on Evasiveness of Graph Properties},
  author={L{\'a}szl{\'o} Lov{\'a}sz and Neal E. Young},
  journal={ArXiv},
  year={2002},
  volume={cs.CC/0205031}
}
  • László Lovász, Neal E. Young
  • Published in ArXiv 2002
  • Mathematics, Computer Science
  • 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. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv