A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers.
Tudor JebeleanPublished in: J. Symb. Comput. (1995)
Keyphrases
- experimental evaluation
- learning algorithm
- optimization algorithm
- computational cost
- cost function
- dynamic programming
- computational complexity
- high accuracy
- preprocessing
- np hard
- single pass
- worst case
- theoretical analysis
- improved algorithm
- selection algorithm
- long sequences
- convex hull
- times faster
- matching algorithm
- segmentation algorithm
- computationally efficient
- optimal solution
- segmentation method
- convergence rate
- recognition algorithm
- estimation algorithm
- similarity measure