GCD of many integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 310-317

  Cooperman, Gene ^a   Feisel, Sandra ^b   Von Zur Gathen, Joachim ^b   Havas, George ^c  

^a NORTHEASTERN UNIVERSITY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

PROBABILISTIC ALGORITHM;

COMBINATORIAL MATHEMATICS;

EID: 84957808203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_31     Document Type: Conference Paper

References (11)

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.
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.
3. Joachim von zur Gathen, Marek Karpinski and Igor Shparlinski, Counting curves and their projections. Computational complexity 6 (1996), 64-99. (Ex- tended Abstract in Proc. 25th ACM Sympos. Theory of Computing.)
4. K. O. Geddes, S. R. Czapor and G. Labahn, Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992.
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.
6. George Havas, Bohdan S. Majewski and Keith R. Matthews, Extended gcd and Hermite normal form algorithms via lattice basis reduction. Experimental Mathematics 7 (1998) 125-136.
7. Chung-Yen Ho and Chee Keng Yap, The Habicht approach to subresultants. Journal of Symbolic Computation 21 (1996), 1-14.
8. Donald E. Knuth, The Art of Computer Programming, Vol.2, Seminumerical Algorithms. Addison-Wesley, Reading MA, 3rd edition, 1997.
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.
10. J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers. Illinois J. Math. 6 (1962), 64-94.
11. Richard Zippel, Effective polynomial computation. Kluwer Academic Publishers, 1993.