Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds.

Kasper Green Larsen Omri Weinstein Huacheng Yu

Published in: STOC (2018)

Keyphrases

data structure
lower bound
upper bound
worst case
efficient data structures
optimal solution
dynamic environments
boolean functions
database
data sets
query processing
tree structure
branch and bound
learning theory