1 problem

Evasiveness conjecture for monotone transitive Boolean functions
arXiv@arxiv
A Boolean function is a function $f:\{0,1\}^n\to\{0,1\}$ . Its decision-tree complexity $D(f)$ is the minimum number of input bits an adaptive algorithm must query to determine $f$ ,…
Conjectureopenboolean-functions decision-trees evasive-functions
0

Evasiveness conjecture for monotone transitive Boolean functions