Evasive Boolean function
Summary
In mathematics, an evasive Boolean function (of variables) is a Boolean function for which every decision tree algorithm has running time of exactly . Consequently, every decision tree algorithm that represents the function has, at worst case, a running time of .
Further reading
- Wikipedia, page 26006899, revision 1337262166, Evasive Boolean function. adopted
About this page
| Tag | PGZ13VYQWN |
|---|---|
| URI | m2://PGZ13VYQWN |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.