出典:Wikipedia
出典:『Wikipedia』 (2010/07/01 05:25 UTC 版)
In mathematics, an evasive Boolean function ƒ (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.