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

Kasper Green Larsen Omri Weinstein Huacheng Yu

Published in: ITA (2018)

Keyphrases

lower bound
data structure
upper bound
worst case
neural network
boolean functions
dynamic environments
efficient data structures
lower and upper bounds
branch and bound algorithm
r tree
branch and bound
np hard
search algorithm
learning algorithm
data types
real valued
objective function