One (more) line on the most Ancient Algorithm in History
Abstract
We give a new simple and short ("one-line") analysis for the runtime of the well-known Euclidean Algorithm. While very short simple, the obtained upper bound in near-optimal.
Origin | Files produced by the author(s) |
---|
Loading...