Stronger Lower Bounds for Online ORAM.
Pavel HubácekMichal KouckýKarel KrálVeronika SlívováPublished in: CoRR (2019)
Keyphrases
- lower bound
- online algorithms
- online learning
- upper bound
- objective function
- branch and bound
- data sets
- information systems
- branch and bound algorithm
- evolutionary algorithm
- linear programming
- active learning
- lower and upper bounds
- learning theory
- knapsack problem
- np hard
- search algorithm
- optimal solution
- data mining
- neural network