An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves.
Pierrick GaudryNicolas GürelPublished in: ASIACRYPT (2001)
Keyphrases
- objective function
- preprocessing
- optimization algorithm
- learning algorithm
- computational complexity
- search space
- detection algorithm
- data sets
- high accuracy
- experimental evaluation
- dynamic programming
- theoretical analysis
- k means
- matching algorithm
- convex hull
- computationally efficient
- genetic algorithm
- particle swarm optimization
- computational cost
- significant improvement
- optimal solution
- input data
- markov random field
- np hard
- cost function
- search algorithm
- b spline
- improved algorithm