Poly-logarithmic adaptive algorithms require revealing primitives.

This paper studies the step complexity of adaptive algorithms, depending on the revealing properties of the primitives used, namely, how many processes are revealed when concurrently applying the primitive (in specific situations).