A subexponential-time, polynomial quantum space algorithm for inverting the CM group action.
David JaoJason T. LeGrowChristopher LeonardiLuis Ruiz-LopezPublished in: J. Math. Cryptol. (2020)
Keyphrases
- search space
- experimental evaluation
- higher dimensional
- improved algorithm
- learning algorithm
- detection algorithm
- neural network
- expectation maximization
- simulated annealing
- dynamic programming
- k means
- optimal solution
- cost function
- constrained optimization
- times faster
- matching algorithm
- tree structure
- theoretical analysis
- computationally efficient
- computational complexity
- preprocessing
- high accuracy
- significant improvement
- worst case
- computational cost
- lower bound
- objective function
- data sets