Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields.
Jean-François BiasseFang SongPublished in: SODA (2016)
Keyphrases
- computationally expensive
- computationally efficient
- computational complexity
- learning algorithm
- small number
- data structure
- significant improvement
- convex optimization problems
- execution times
- highly efficient
- combinatorial optimization
- computational cost
- times faster
- finite number
- space complexity
- computationally intensive
- optimization problems
- multiple classes
- information retrieval
- machine learning algorithms
- efficient implementation
- theoretical analysis
- random graphs