๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Factoring distance matrix polynomials

โœ Scribed by Karen L. Collins

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
584 KB
Volume
122
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Factoring Modular Polynomials
Factoring Modular Polynomials
โœ J. VON ZUR GATHEN; S. HARTLIEB ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 642 KB

This paper gives an algorithm to factor a polynomial f (in one variable) over rings like Z /rZ for r โˆˆ Z or F q [y]/rF q [y] for r โˆˆ F q [y]. The Chinese Remainder Theorem reduces our problem to the case where r is a prime power. Then factorization is not unique, but if r does not divide the discrim

Factorization of matrix polynomials
Factorization of matrix polynomials
โœ A. N. Malyshev ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 653 KB
Factoring Polynomials Over Local Fields
Factoring Polynomials Over Local Fields
โœ Sebastian Pauli ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

We describe an efficient new algorithm for factoring a polynomial ฮฆ(x) over a field k that is complete with respect to a discrete prime divisor. For every irreducible factor ฯ•(x) of ฮฆ(x) this algorithm returns an integral basis for k[x]/ฯ•(x)k[x] over k.