Lower Bounds for Multi-Server Oblivious RAMs.
Kasper Green LarsenMark SimkinKevin YeoPublished in: IACR Cryptol. ePrint Arch. (2019)
Keyphrases
- search algorithm
- lower bound
- branch and bound
- upper bound
- branch and bound algorithm
- optimal solution
- randomly generated problems
- lower bounding
- np hard
- objective function
- lower and upper bounds
- upper and lower bounds
- quadratic assignment problem
- worst case
- search space
- database
- vc dimension
- lagrangian relaxation
- running times
- data sets
- optimal cost
- database management systems
- sample complexity