A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
Razvan BarbulescuPierrick GaudryAntoine JouxEmmanuel ThoméPublished in: CoRR (2013)
Keyphrases
- dynamic programming
- cost function
- optimization algorithm
- high accuracy
- optimal solution
- expectation maximization
- improved algorithm
- experimental evaluation
- learning algorithm
- path planning
- computational complexity
- detection algorithm
- image registration
- polynomially bounded
- segmentation algorithm
- convergence rate
- input data
- worst case
- np hard
- feature space
- preprocessing
- image segmentation
- computer vision
- linear programming
- state space
- particle swarm optimization
- computationally efficient
- k means
- similarity measure
- convex hull
- continuous optimization
- data sets