Computing discrete logarithms using Joux's algorithm.
Gora AdjAlfred MenezesThomaz OliveiraFrancisco Rodríguez-HenríquezPublished in: ACM Commun. Comput. Algebra (2015)
Keyphrases
- matching algorithm
- computational cost
- experimental evaluation
- single pass
- computationally efficient
- learning algorithm
- times faster
- theoretical analysis
- path planning
- high accuracy
- k means
- search space
- memory requirements
- cost function
- np hard
- dynamic programming
- probabilistic model
- worst case
- computational complexity
- linear programming
- neural network
- recognition algorithm
- objective function
- data sets
- tree structure
- input data
- markov random field
- image processing
- significant improvement
- preprocessing
- optimal solution