A Lower Bound for One-Round Oblivious RAM.
David CashAndrew DruckerAlexander HooverPublished in: IACR Cryptol. ePrint Arch. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- lower and upper bounds
- worst case
- sufficiently accurate
- optimal solution
- lower bounding
- main memory
- upper and lower bounds
- lagrangian relaxation
- competitive ratio
- polynomial approximation
- real time
- data structure
- neural network
- linear programming relaxation
- branch and bound method