A tight lower bound for searching a sorted array.
Arne AnderssonJohan HåstadOla PeterssonPublished in: STOC (1995)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- np hard
- worst case
- objective function
- upper and lower bounds
- branch and bound method
- linear array
- lower bounding
- information retrieval
- search strategies
- optimal solution
- neural network
- sample complexity
- high speed
- lagrangian relaxation
- linear programming relaxation
- data structure
- sufficiently accurate