On Degrees of Modular Common Divisors and the Big Prime gcd Algorithm
We consider a few modifications of the Big prime modular gcd algorithm for polynomials in Z[x]. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant, and on finding preliminary bounds on degrees of com...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Wiley
2016-01-01
|
| coleção: | International Journal of Mathematics and Mathematical Sciences |
| Acesso em linha: | http://dx.doi.org/10.1155/2016/3262450 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|