On Degrees of Modular Common Divisors and the Big Prime Algorithm

Vahagn Mikaelian

International Journal of Mathematics and Mathematical Sciences, 2016, vol. 2016, 1-13

Abstract:

We consider a few modifications of the Big prime modular algorithm for polynomials in . 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 common divisors using auxiliary primes. These modifications are used to suggest improved algorithms for calculation and for coprime polynomials detection. To illustrate the ideas we apply the constructed algorithms on certain polynomials, in particular on polynomials from Knuth’s example of intermediate expression swell.

Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2016/3262450.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2016/3262450.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:3262450

DOI: 10.1155/2016/3262450

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().