A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem.
Takashi MiharaShao Chin SungPublished in: ISAAC (1998)
Keyphrases
- worst case
- average case
- optimization algorithm
- computational complexity
- times faster
- preprocessing
- improved algorithm
- cost function
- dynamic programming
- learning algorithm
- space complexity
- computational cost
- np hard
- optimal solution
- similarity measure
- experimental evaluation
- probabilistic model
- running times
- high accuracy
- convergence rate
- segmentation algorithm
- detection algorithm
- clustering method
- greedy algorithm
- matching algorithm
- online algorithms
- neural network
- complexity bounds
- error bounds
- tree structure
- theoretical analysis
- particle swarm optimization
- simulated annealing
- multi class
- special case
- significant improvement
- k means