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

Factoring Polynomials and Fibonacci

โœ Scribed by STEVEN SCHWARTZMAN

Book ID
125523870
Publisher
National Council of Teachers of Mathematics
Year
1986
Weight
721 KB
Volume
79
Category
Article
ISSN
0025-5769

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

Factoring distance matrix polynomials
Factoring distance matrix polynomials
โœ Karen L. Collins ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB
Factoring Polynomials and the Knapsack P
Factoring Polynomials and the Knapsack Problem
โœ Mark van Hoeij ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

For several decades the standard algorithm for factoring polynomials f with rational coefficients has been the Berlekamp-Zassenhaus algorithm. The complexity of this algorithm depends exponentially on n, where n is the number of modular factors of f . This exponential time complexity is due to a com