EUCLID'S GCD ALGORITHM IS NOT OPTIMAL PART I. UPPER BOUND
Date
1991-05-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Using linear arithmetic operations, the floor operation, and indirect
addressing, we sequentially compute
Lower Bound), we prove that, using the given operations, this bound is
tight.
We also study the direct sum complexity of computing the GCD and also
the complexity of computing the GCD using tables of bounded size.
Description
Keywords
Computer Science