GCD of Many Integers (Extended Abstract)

  • Gene Cooperman
  • Sandra Feisel
  • Joachim von zur Gathen
  • George Havas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1627)


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.


Success Probability Algebraic Computation Random Integer Probabilistic Algorithm Decimal Digit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.MathSciNetGoogle Scholar
  2. 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. 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.)CrossRefMathSciNetGoogle Scholar
  4. 4.
    vK. O. Geddes, S. R. Czapor AND G. Labahn, Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992.Google Scholar
  5. 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. 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.zbMATHMathSciNetGoogle Scholar
  7. 7.
    Chung-Yen Ho and Chee Keng Yap, The Habicht approach to subresultants. Journal of Symbolic Computation21 (1996), 1–14.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Donald E. Knuth, The Art of Computer Programming, Vol.2, Seminumerical Algorithms. Addison-Wesley, Reading MA, 3rd edition, 1997.Google Scholar
  9. 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. 10.
    J. Barkley Rosser AND Lowell Schoenfeld, Approximate formulas for some functions of prime numbers. Illinois J. Math.6 (1962), 64–94.zbMATHMathSciNetGoogle Scholar
  11. 11.
    Richard Zippel, Effective polynomial computation. Kluwer Academic Publishers, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gene Cooperman
    • 1
  • Sandra Feisel
    • 2
  • Joachim von zur Gathen
    • 2
  • George Havas
    • 3
  1. 1.College of Computer ScienceNortheastern UniversityBostonUSA
  2. 2.FB Mathematik-InformatikUniversität-GH PaderbornPaderbornGermany
  3. 3.Centre for Discrete Mathematics and Computing Department of Computer Science and Electrical EngineeringThe University of QueenslandQueenslandAustralia

Personalised recommendations