Part of the Lecture Notes in Computer Science book series (LNCS, volume 1627)
GCD of Many Integers (Extended 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.
KeywordsSuccess 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.
- 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
- 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
- 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
- 11.Richard Zippel, Effective polynomial computation. Kluwer Academic Publishers, 1993.Google Scholar
© Springer-Verlag Berlin Heidelberg 1999