Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.
Greg N. FredericksonPublished in: Theor. Comput. Sci. (1984)
Keyphrases
- efficient data structures
- lower bound
- data structure
- upper bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- branch and bound
- np hard
- optimal solution
- worst case
- upper and lower bounds
- linear programming relaxation
- coarse to fine
- index structure
- competitive ratio
- neural network
- sufficiently accurate
- learning algorithm
- sample complexity
- network flow
- approximation algorithms
- data types
- total order
- database
- knuth bendix