Lecture Notes on Evasiveness of Graph Properties

Details Lecture Notes on Evasiveness of Graph Properties Lecture Notes on Evasiveness of Graph Properties

2002-05-18

arxiv.org/abs/cs/0205031v1

Computer Science

Computational Complexity

Tech. Rep. CS-TR-317-91, Computer Science Dept., Princeton University

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lecture Notes on Evasiveness of Graph Properties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lecture Notes on Evasiveness of Graph Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lecture Notes on Evasiveness of Graph Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599120