Extending the Promise of the Deutsch-Jozsa-Høyer Algorithm for Finite Groups.
Michael BattyAndrew J. DuncanSamuel L. BraunsteinPublished in: LMS J. Comput. Math. (2006)
Keyphrases
- computational cost
- times faster
- experimental evaluation
- dynamic programming
- similarity measure
- high accuracy
- selection algorithm
- detection algorithm
- optimization algorithm
- worst case
- cost function
- objective function
- preprocessing
- single pass
- reinforcement learning
- recognition algorithm
- matching algorithm
- computational complexity
- computationally efficient
- expectation maximization
- k means
- input data
- linear programming
- learning algorithm
- search space
- convex hull
- knn
- scheduling problem
- improved algorithm
- space complexity