Lesson plan
Evasive Boolean function
In mathematics, an evasive Boolean function f (of n variables) is a Boolean function for which every decision tree algorithm has running time of exactly n . Consequently, every decision tree algorithm that represents the function has, at worst case, a running time of n .
Article summary
In mathematics, an evasive Boolean function f (of n variables) is a Boolean function for which every decision tree algorithm has running time of exactly n . Consequently, every decision tree algorithm that represents the function has, at worst case, a running time of n .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.