Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus.
Katherine E. StangePublished in: CoRR (2022)
Keyphrases
- dynamic programming
- improved algorithm
- times faster
- computational complexity
- optimization algorithm
- k means
- significant improvement
- linear programming
- experimental evaluation
- computational cost
- probabilistic model
- matching algorithm
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- high accuracy
- np hard
- worst case
- cost function
- search space
- recognition algorithm
- database
- graph cuts
- theoretical analysis
- high dimensional
- lower bound
- classification algorithm
- search algorithm
- optimal solution
- convergence rate
- learning algorithm