GCD of many integers (extended abstract)

Authors:
Gene Cooperman;Sandra Feisel;Joachim von zur Gathen;George Havas
Affiliations:
College of Computer Science, Northeastern University, Boston, MA;FB Mathematik-Informatik, Universität-GH Paderborn, Paderborn, Germany;FB Mathematik-Informatik, Universität-GH Paderborn, Paderborn, Germany;Centre for Discrete Mathematics and Computing, Department of Computer Science and Electrical Engineering, The University of Queensland, Queensland, Australia
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 7
Cited 6

Algorithms for computer algebra

Algorithms for computer algebra
Fast computation of the Smith normal form of an integer matrix

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A solution to the extended gcd problem

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
The Habicht approach to subresultants

Journal of Symbolic Computation
Counting curves and their projections

Computational Complexity
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Subresultants revisited

Theoretical Computer Science - Latin American theoretical informatics
Acceleration of Euclidean algorithm and extensions

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Fast arithmetics using Chinese remaindering

Information Processing Letters
GCD of random linear forms

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On computation of the greatest common divisor of several polynomials over a finite field

Finite Fields and Their Applications
Fast parallel GCD algorithm of many integers

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

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.