arXiv
Open Access
2018
One (more) line on the most Ancient Algorithm in History
Bruno Grenet
Ilya Volkovich
Abstrak
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.
Topik & Kata Kunci
Penulis (2)
B
Bruno Grenet
I
Ilya Volkovich
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2018
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓