Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation
Paul BeameMichael E. SaksXiaodong SunErik VeePublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- lower bound
- upper bound
- worst case
- objective function
- space time
- randomized algorithm
- branch and bound
- low dimensional
- query processing
- efficient computation
- upper and lower bounds
- computational complexity
- randomized algorithms
- linear programming
- genetic algorithm
- trade off
- vc dimension
- higher dimensional
- lower and upper bounds
- optimal cost