Analysis of recursive Diophantine solver yields periodic call-count function with constant-term average improvement over Extended Euclid; proposed iterative variant outperforms Euclid in 100% of tested solvable instances.
The number of steps in the Euclidean algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An average case efficient algorithm for solving two-variable linear Diophantine equations
Analysis of recursive Diophantine solver yields periodic call-count function with constant-term average improvement over Extended Euclid; proposed iterative variant outperforms Euclid in 100% of tested solvable instances.