On computation of the greatest common divisor of several polynomials over a finite field |
| |
| Authors: | Alessandro Conflitti |
| |
| Institution: | Dipartimento di Matematica, Università degli Studi di Roma “Tor Vergata”, Via della Ricerca Scientifica, I-00133, Roma, Italy |
| |
| 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 |
| 本文献已被 ScienceDirect 等数据库收录！ |
