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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Wiley
2016-01-01
|
| Serie: | International Journal of Mathematics and Mathematical Sciences |
| Accesso online: | http://dx.doi.org/10.1155/2016/3262450 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|