Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

I'm trying to collect examples of exhibiting an adversary to prove that a Boolean function is evasive. I know of several examples of graph properties for which adversary methods have been used, i.e. graph connectedness and containing a triangle, however I'm hoping to find other interesting examples.

share|improve this question
Google for "Lecture Notes on Evasiveness of Graph Properties". –  Neal Young Dec 23 '12 at 19:54
More precisely: see arxiv.org/abs/cs/0205031 for Neal Young's notes from a lecture course given by László Lovász at Princeton in 1990. –  András Salamon Apr 30 at 12:06

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.