pith. sign in

arxiv: cs/0205031 · v1 · pith:VC6XURHWnew · submitted 2002-05-18 · 💻 cs.CC

Lecture Notes on Evasiveness of Graph Properties

Laszlo Lovasz , Neal E. Young This is my paper
classification 💻 cs.CC
keywords graphevasivenessmanynotespropertiespropertyalgorithmbefore
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Instance complexity of Boolean functions

    cs.CC 2023-09 unverdicted novelty 6.0

    Instance complexity of symmetric Boolean functions is completely characterized with only Parity and complement at value 1; Greater-Than and Odd-Max-Bit have constant IC while QC/C_min is linear.