<p>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. </p>

CC BY-SA 3.0
2012-12-23T19:54:05.303Z
Google for "Lecture Notes on Evasiveness of Graph Properties".
Neal Young
CC BY-SA 3.0
2015-04-30T12:06:37.843Z
More precisely: see http://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
<boolean-functions>
Exhibiting an adversary to prove a boolean function is evasive
ahsat
# Exhibiting an adversary to prove a boolean function is evasive

(Asked by: username_0 on 2012-12-23)

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.

**Tags:** boolean-functions

> **Comments:**
> **username_1**: Google for "Lecture Notes on Evasiveness of Graph Properties".  
> **username_2**: More precisely: see http://arxiv.org/abs/cs/0205031 for username_1's notes from a lecture course given by László Lovász at Princeton in 1990.  

---

## 0 answers

