Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers.
Sivaramakrishnan Natarajan RamamoorthyAnup RaoPublished in: Computational Complexity Conference (2018)
Keyphrases
- lower bound
- data structure
- upper bound
- objective function
- branch and bound algorithm
- real numbers
- efficient data structures
- worst case
- data types
- branch and bound
- lower and upper bounds
- multi dimensional
- lower bounding
- upper and lower bounds
- convex sets
- database
- query processing
- search algorithm
- real world
- neural network