• Information Technology
  • Human Resources
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
My UCalgary
Webmail
D2L
ARCHIBUS
IRISS
  • Faculty of Arts
  • Cumming School of Medicine
  • Faculty of Environmental Design
  • Faculty of Graduate Studies
  • Haskayne School of Business
  • Faculty of Kinesiology
  • Faculty of Law
  • Faculty of Nursing
  • Faculty of Nursing (Qatar)
  • Schulich School of Engineering
  • Faculty of Science
  • Faculty of Social Work
  • Faculty of Veterinary Medicine
  • Werklund School of Education
  • Information TechnologiesIT
  • Human ResourcesHR
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
  • Libraries and Cultural Resources
View Item 
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

EUCLID'S GCD ALGORITHM IS NOT OPTIMAL PART I. UPPER BOUND

Thumbnail
Download
1991-430-14.pdf (3.779Mb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
Bshouty, Nader H.
Accessioned
2008-02-27T16:48:54Z
Available
2008-02-27T16:48:54Z
Computerscience
1999-05-27
Issued
1991-05-01
Subject
Computer Science
Type
unknown
Metadata
Show full item record

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.
Notes
We 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.ca
Corporate
University of Calgary
Faculty
Science
Doi
http://dx.doi.org/10.11575/PRISM/30476
Uri
http://hdl.handle.net/1880/45741
Collections
  • Science Research & Publications

Browse

All of PRISMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Download Results

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

  • Email
  • SMS
  • 403.220.8895
  • Live Chat

Energize: The Campaign for Eyes High

Privacy Policy
Website feedback

University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4
CANADA

Copyright © 2017