ブール関数
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".