Monotone Properties of k-Uniform Hypergraphs Are Weakly Evasive

Abstract

A Boolean function in n variables is weakly evasive if its decision-tree complexity is (n). By k-graphs, we mean k-uniform hypergraphs. A k-graph property on v vertices is a Boolean function on n =...