Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45741
Title: EUCLID'S GCD ALGORITHM IS NOT OPTIMAL PART I. UPPER BOUND
Authors: Bshouty, Nader H.
Keywords: Computer Science
Issue Date: 1-May-1991
Abstract: Using linear arithmetic operations, the floor operation, and indirect addressing, we sequentially compute $GCD(x,y)$ for $0~<=~x,y~<=~N$, and find two integers $-N~<=~a,b~<=~N$ such that $ax~+~by~=~GCD(x,y)$ with operation complexity 0 left ( {log~N} over {log~log~N} right ) and space complexity $0(($log$~N) sup epsilon )$ for any constant $0~<~epsilon~<~1$. The intermediate numbers obtained during the execution of these algorithms are all less than $max(x,y)$. In the second part of this paper (Part II. 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.
URI: http://hdl.handle.net/1880/45741
Appears in Collections:Bshouty, Nader

Files in This Item:
File Description SizeFormat 
1991-430-14.pdf3.87 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.