An **evasive Boolean function** is a specific type of Boolean function that exhibits a particular behavior in terms of how it is evaluated or how many inputs need to be queried to determine its value.
Articles by others on the same topic
A Boolean function is evasive when every deterministic decision tree computing it has a worst-case path that queries all input bits. The alternating-sum criterion for decision-tree evasiveness is one sufficient method for proving this lower bound.