On computation of the greatest common divisor of several polynomials over a finite field

Authors:
Alessandro Conflitti
Affiliations:
Dipartimento di Matematica, Universití degli Studi di Roma "Tor Vergata", Via della Ricerca Scientifica, I-00133 Roma, Italy
Venue:
Finite Fields and Their Applications
Year:
2003

Citing 2
Cited 0

Diophantine linear system solving

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
GCD of many integers (extended abstract)

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m-1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.