𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Polynomial Factorization and Modular Composition

✍ Scribed by Kedlaya, Kiran S.; Umans, Christopher

Book ID
118161901
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
427 KB
Volume
40
Category
Article
ISSN
0097-5397

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

Multi-Modular Approach to Polynomial-Tim
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials
✍ Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 685 KB

Efficient algorithms to factorize bivariate integral polynomials are discussed. As a key technique to provide the most efficient algorithms in theory, an approach, named multimodular approach, is proposed and its implication is discussed intensively. The approach uses combined information from sever