Cumulative Memory Lower Bounds for Randomized and Quantum Computation.
Paul BeameNiels KornerupPublished in: CoRR (2023)
Keyphrases
- quantum computation
- lower bound
- upper bound
- randomized algorithms
- randomized algorithm
- objective function
- branch and bound
- vc dimension
- branch and bound algorithm
- lower and upper bounds
- optimal cost
- memory requirements
- optimal solution
- memory usage
- np hard
- worst case
- limited memory
- lower bounding
- computational power
- decision trees
- low memory
- online algorithms
- memory space
- upper and lower bounds
- quadratic assignment problem
- linear programming relaxation
- max sat
- neural network
- main memory