On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic.
Giacomo MicheliPublished in: SIAM J. Appl. Algebra Geom. (2019)
Keyphrases
- detection algorithm
- optimal solution
- learning algorithm
- improved algorithm
- selection algorithm
- computational complexity
- optimization algorithm
- worst case
- dynamic programming
- computational cost
- experimental evaluation
- np hard
- expectation maximization
- theoretical analysis
- k means
- search space
- objective function
- simulated annealing
- linear programming
- special case
- times faster