Skip to main content
SpringerLink
Log in

GCD of Many Integers (Extended Abstract)

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1627))

Included in the following conference series:

Abstract

A probabilistic algorithm is exhibited that calculates the gcd of many integers using gcds of pairs of integers; the expected number of pairwise gcds required is less than two.

Supported in part by NSF Grant CCR-9509783

Supported in part by the Australian Research Council

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gene Cooperman AND George Havas, Elementary Algebra Revisited: Randomized Algorithms. In Randomization Methods in Algorithm Design, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999) 37–44.

    MathSciNet  Google Scholar 

  2. Angel DÍaz AND Erich Kaltofen, On computing greatest common divisors with polynomials given by black boxes for their evaluations. In ISSAC'95 (Proc. Internat. Sympos. Symbolic and Algebraic Computation), ACM Press (1995) 232–239.

    Google Scholar 

  3. Joachim VON ZUR Gathen, Marek Karpinski AND Igor Shparlinski, Counting curves and their projections. Computational complexity6 (1996), 64–99. (Extended Abstract in Proc. 25th ACM Sympos. Theory of Computing.)

    Article  MathSciNet  Google Scholar 

  4. vK. O. Geddes, S. R. Czapor AND G. Labahn, Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992.

    Google Scholar 

  5. Mark Giesbrecht, Fast computation of the Smith normal form of an integer matrix, In ISSAC'95 (Proc. Internat. Sympos. Symbolic and Algebraic Computation) ACM Press (1995) 110–118.

    Google Scholar 

  6. George Havas, Bohdan S. Majewski AND Keith R. Matthews, Extended gcd and Hermite normal form algorithms via lattice basis reduction. Experimental Mathematics7 (1998) 125–136.

    MATH  MathSciNet  Google Scholar 

  7. Chung-Yen Ho and Chee Keng Yap, The Habicht approach to subresultants. Journal of Symbolic Computation21 (1996), 1–14.

    Article  MATH  MathSciNet  Google Scholar 

  8. Donald E. Knuth, The Art of Computer Programming, Vol.2, Seminumerical Algorithms. Addison-Wesley, Reading MA, 3rd edition, 1997.

    Google Scholar 

  9. Bohdan S. Majewski AND George Havas, A solution to the extended gcd problem. In ISSAC'95 (Proc. Internat. Sympos. Symbolic and Algebraic Computation) ACM Press (1995) 248–253.

    Google Scholar 

  10. J. Barkley Rosser AND Lowell Schoenfeld, Approximate formulas for some functions of prime numbers. Illinois J. Math.6 (1962), 64–94.

    MATH  MathSciNet  Google Scholar 

  11. Richard Zippel, Effective polynomial computation. Kluwer Academic Publishers, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Northeastern University, Boston, MA, 02115, USA

    Gene Cooperman

  2. FB Mathematik-Informatik, Universität-GH Paderborn, 33095, Paderborn, Germany

    Sandra Feisel & Joachim von zur Gathen

  3. Centre for Discrete Mathematics and Computing Department of Computer Science and Electrical Engineering, The University of Queensland, Queensland, 4072, Australia

    George Havas

Authors
  1. Gene Cooperman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandra Feisel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joachim von zur Gathen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. George Havas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and System Engineering Faculty of Science and Engineering, Chuo University, 1-13-27, Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan

    Takano Asano

  2. Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hideki Imai

  3. Academia Sinica, Institute of Information Science, Nankang, Taipei, Taiwan

    D. T. Lee

  4. Department of Computer Science Faculty of Engineering, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma, 376-8515, Japan

    Shin-ichi Nakano

  5. IBM Tokyo Research Laboratory, 1623-14, Shimo-Tsuruma, Yamato Kanagawa, 242-0001, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cooperman, G., Feisel, S., von zur Gathen, J., Havas, G. (1999). GCD of Many Integers (Extended Abstract). In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-48686-0_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66200-6

  • Online ISBN: 978-3-540-48686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation