## Crossing the logarithmic barrier for dynamic boolean data structure lower bounds

This paper proves the first super-logarithmic lower bounds on the cell-probe complexity of dynamic boolean (a.k.a. decision) data structure problems, a long-standing milestone in data structure lower bounds.