Is There an Oblivious RAM Lower Bound for Online Reads?
Mor WeissDaniel WichsPublished in: J. Cryptol. (2021)
Keyphrases
- lower bound
- upper bound
- online algorithms
- online learning
- real time
- branch and bound algorithm
- branch and bound
- worst case
- lower and upper bounds
- information retrieval
- np hard
- learning environment
- optimal solution
- objective function
- power consumption
- e learning
- linear programming relaxation
- genetic algorithm
- online environment