1 problem

Let $f$ be a monotone graph property on graphs with $n$ vertices, and let $R(f)$ denote its randomized decision-tree complexity: the minimum, over randomized algorithms, of the max…