Title of article
On computation of the greatest common divisor of several polynomials over a finite field
Author/Authors
Alessandro Conflitti، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
9
From page
423
To page
431
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.
Keywords
Polynomials over a finite field , greatest common divisor , Probabilistic algorithm
Journal title
Finite Fields and Their Applications
Serial Year
2003
Journal title
Finite Fields and Their Applications
Record number
701105
Link To Document