A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields.
Leonard M. AdlemanJonathan DeMarraisMing-Deh A. HuangPublished in: ANTS (1994)
Keyphrases
- computational cost
- dynamic programming
- k means
- learning algorithm
- improved algorithm
- detection algorithm
- experimental evaluation
- convex hull
- preprocessing
- significant improvement
- cost function
- objective function
- times faster
- theoretical analysis
- finite number
- search space
- computer vision
- optimization algorithm
- computationally efficient
- input data
- linear programming
- simulated annealing
- optimal solution
- particle swarm optimization
- worst case
- matching algorithm
- reinforcement learning
- mobile robot
- neural network