Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.
Rahul TripathiPublished in: MFCS (2007)
Keyphrases
- upper bound
- worst case
- lower bound
- quantum mechanics
- quantum computation
- complexity analysis
- upper and lower bounds
- computational complexity
- space complexity
- computational models
- quantum probability
- efficiently computable
- lower and upper bounds
- efficient computation
- sample complexity
- data sets
- branch and bound
- decision problems
- sample size
- computational cost
- objective function