Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
Evasive Boolean function: History, Definition & Examples
In mathematics, an evasive Boolean function f {\displaystyle f} (of n {\displaystyle n} variables) is a Boolean function for which every decision tree algorithm has running time of exactly n {\displaystyle n} . Consequently, every decision tree algorithm that represents the function has, at worst case, a running time of n {\displaystyle n} .
Language: English [EN]
