An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields
Jean-François BiassePublished in: CoRR (2012)
Keyphrases
- execution times
- computational complexity
- high accuracy
- recognition algorithm
- preprocessing
- learning algorithm
- times faster
- simulated annealing
- k means
- optimization algorithm
- computational effort
- search space
- probabilistic model
- experimental evaluation
- dynamic programming
- np hard
- space complexity
- computational cost
- small number
- worst case
- training set
- expectation maximization
- memory requirements
- clustering method
- ant colony optimization
- matching algorithm
- objective function
- single scan
- improved algorithm
- cluster centers
- detection algorithm
- particle swarm optimization
- multi objective
- significant improvement
- similarity measure
- computer vision