Static Data Structure Lower Bounds Imply Rigidity.
Zeev DvirAlexander GolovnevOmri WeinsteinPublished in: CoRR (2018)
Keyphrases
- lower bound
- data structure
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- optimal solution
- data sets
- point correspondences
- lower and upper bounds
- vc dimension
- np hard
- data types
- worst case
- randomly generated problems
- index structure
- itemsets
- suffix tree
- upper and lower bounds
- multi dimensional
- quadtree
- external memory
- quadratic assignment problem
- lower bounding
- set of randomly generated instances