Randomized and quantum algorithms yield a speed-up for initial-value problems.
Boleslaw Z. KacewiczPublished in: J. Complex. (2004)
Keyphrases
- optimization problems
- related problems
- np hard problems
- computational cost
- combinatorial optimization
- randomized algorithms
- greedy algorithms
- computational geometry
- problems in computer vision
- approximate solutions
- theoretical guarantees
- specific problems
- learning algorithm
- computational complexity
- search methods
- inference problems
- decision problems
- theoretical analysis
- computationally efficient
- reinforcement learning
- data structure
- significant improvement
- benchmark problems
- computational problems
- machine learning
- neural network
- practical problems
- search problems
- constraint programming
- data sets
- times faster
- benchmark datasets
- search space