Static Data Structure Lower Bounds Imply Rigidity.
Zeev DvirAlexander GolovnevOmri WeinsteinPublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- lower bound
- data structure
- upper bound
- branch and bound algorithm
- lower and upper bounds
- point correspondences
- branch and bound
- efficient data structures
- optimal solution
- data types
- objective function
- quadtree
- vc dimension
- space efficient
- main memory
- index structure
- inverted index
- suffix tree
- dynamic analysis
- lower bounding
- polynomial approximation
- np hard
- online algorithms
- quadratic assignment problem
- linked list
- randomly generated problems
- knapsack problem
- tree structure
- worst case