Polynomial time quantum algorithm for the computation of the unit group of a number field.
Arthur SchmidtUlrich VollmerPublished in: STOC (2005)
Keyphrases
- computational complexity
- experimental evaluation
- memory requirements
- search space
- computational effort
- optimization algorithm
- worst case
- dynamic programming
- computational cost
- learning algorithm
- space complexity
- expectation maximization
- polynomial time complexity
- times faster
- np hard
- optimal solution
- preprocessing
- neural network
- small number
- randomized algorithm
- recognition algorithm
- theoretical analysis
- particle swarm optimization
- high accuracy
- multi objective
- matching algorithm
- k means
- segmentation algorithm
- convergence rate
- cost function
- decision trees
- quantum inspired