EUCLIDEAN GCD ALGORITHM IS NOT OPTIMAL

dc.contributor.authorBshouty, Nader H.eng
dc.date.accessioned2008-05-26T20:40:42Z
dc.date.available2008-05-26T20:40:42Z
dc.date.computerscience1999-05-27eng
dc.date.issued1989-12-01eng
dc.description.abstractUsing the operations {$+,~-$}, multiplication and division by constants {$x sub z ,~/z$}, floor operation, {$\(lf~\(rf$} and indirect addressing, we compute $GCD(x,y),~x,y~\(mo~[0,N]$ and find $a,b~\(mo~[0,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 numbers that are produced in the algorithms are less than $ max(x,y)$. We also prove that using these operations our bound is tight. In the boolean model we prove that to obtain this upper bound we must use $OMEGA ((log N) sup epsilon )$ space for some constant $ epsilon $. We also study the direct sum complexity of GCD and prove that GCD function does not satisfy the direct sum conjecture and we study the operation complexity of computing GCD and LCM of $n$ numbers and find tight bounds for these problems.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1989-376-38eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30475
dc.identifier.urihttp://hdl.handle.net/1880/46601
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleEUCLIDEAN GCD ALGORITHM IS NOT OPTIMALeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1989-376-38.pdf
Size:
2.99 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description: