A Lower Bound for One-Round Oblivious RAM.
David CashAndrew DruckerAlexander HooverPublished in: TCC (1) (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- np hard
- upper and lower bounds
- worst case
- neural network
- lower bounding
- linear programming relaxation
- design considerations
- lagrangian relaxation
- vc dimension
- knapsack problem
- multi dimensional
- database systems
- online algorithms
- real time
- branch and bound method
- polynomial approximation