One (more) line on the most Ancient Algorithm in History

Bruno Grenet (1) , Ilya Volkovich (2)

1 ECO - Exact Computing
2 University of Michigan [Ann Arbor]

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.

Domaines: Complexité [cs.CC]; Calcul formel [cs.SC]

Bruno Grenet, Ilya Volkovich. One (more) line on the most Ancient Algorithm in History. SOSA 2020 - 1st Symposium on Simplicity in Algorithms, Jan 2020, Salt Lake City, United States. ⟨10.1137/1.9781611976014.3⟩. ⟨lirmm-02335368⟩