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.
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.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top