A function [math]f:\{-1,1\}^n \to \{-1,1\}[/math] is called evasive if its deterministic decision tree complexity is exactly [math]n[/math].
The following 4 pages are in this category, out of 4 total.
