neal young / Lovasz91Lecture
-
Technical Report, Computer Science Department, Princeton University CS-TR-317-91(1991)
This technical report presented notes from the first eight
lectures of the class Many Models of Complexity
taught by László Lovász 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.
© Copyrights are reserved by the publishers.
Download for personal and limited academic use only.