On Quantum Algorithm for Binary Search and Its Computational Complexity.
Satoshi IriyamaMasanori OhyaIgor V. VolovichPublished in: CoRR (2013)
Keyphrases
- computational complexity
- binary search
- dynamic programming
- preprocessing
- learning algorithm
- computational load
- np hard
- times faster
- detection algorithm
- special case
- k means
- simulated annealing
- memory requirements
- path planning
- single pass
- optimization algorithm
- theoretical analysis
- computationally efficient
- np complete
- data sets
- high accuracy
- computational cost
- experimental evaluation
- search space
- linear computational complexity
- expectation maximization
- similarity measure
- objective function
- support vector
- improved algorithm
- significant improvement
- computational efficiency
- probabilistic model
- segmentation algorithm
- support vector machine svm
- worst case