On Quantum Algorithm for Binary Search and Its Computational Complexity.
Satoshi IriyamaMasanori OhyaIgor V. VolovichPublished in: Open Syst. Inf. Dyn. (2015)
Keyphrases
- computational complexity
- binary search
- computational cost
- np hard
- matching algorithm
- single pass
- cost function
- learning algorithm
- k means
- dynamic programming
- experimental evaluation
- computational efficiency
- detection algorithm
- worst case
- high computational complexity
- classification algorithm
- particle swarm optimization
- neural network
- search space
- tree structure
- path planning
- times faster
- preprocessing
- face recognition
- linear computational complexity