Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds.

Kasper Green Larsen Omri Weinstein Huacheng Yu

Published in: SIAM J. Comput. (2020)

Keyphrases

data structure
lower bound
worst case
dynamic environments
neural network
upper bound
objective function
np hard
special case
real valued
optimal cost
multiresolution
search algorithm
error bounds
space efficient
quadratic assignment problem
insertions and deletions