Lecture Notes on Evasiveness of Graph Properties
Skip to main content
eScholarship
Open Access Publications from the University of California

UC Riverside

UC Riverside Previously Published Works bannerUC Riverside

Lecture Notes on Evasiveness of Graph Properties

  • Author(s): Lovasz, Laszlo
  • Young, Neal E
  • et al.

Published Web Location

https://arxiv.org/pdf/cs/0205031
No data is associated with this publication.
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.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Item not freely available? Link broken?
Report a problem accessing this item