Static data structure lower bounds imply rigidity.
Zeev DvirAlexander GolovnevOmri WeinsteinPublished in: STOC (2019)
Keyphrases
- lower bound
- data structure
- upper bound
- efficient data structures
- upper and lower bounds
- lower and upper bounds
- objective function
- space efficient
- sample complexity
- branch and bound
- point correspondences
- branch and bound algorithm
- worst case
- lower bounding
- data types
- main memory
- r tree
- combinatorial optimization
- index structure
- quadtree
- learning theory
- knn
- np hard
- special case
- linear programming relaxation
- learning algorithm