A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity.
Yuqing ZhuJincheng ZhuangHairong YiChang LvDongdai LinPublished in: Des. Codes Cryptogr. (2019)
Keyphrases
- computational complexity
- improved algorithm
- worst case
- dynamic programming
- computational cost
- experimental evaluation
- optimization algorithm
- k means
- detection algorithm
- times faster
- np hard
- space complexity
- computationally efficient
- learning algorithm
- high accuracy
- memory requirements
- lower complexity
- continuous optimization
- cost function
- significant improvement
- preprocessing
- optimal solution
- objective function
- discrete version
- state space
- neural network
- image sequences
- linear complexity
- complexity analysis
- similarity measure
- multiscale
- selection algorithm
- path planning
- classification algorithm
- tree structure
- search space
- theoretical analysis
- expectation maximization
- linear programming
- multi objective