Polynomial factorization challenges (1996) [3 citations — 0 self]
Download:
|
|
by Paul Zimmermann, Inria Lorraine, Laurent Bernardin, Michael Monagan
List of papers published in the Reports on Computer Algebra series
http://www.inf.ethz.ch/personal/bernardi/publications/challenge.ps.gz
Add To MetaCart
Abstract:
Joachim von zur Gathen has proposed a challenge for factoring univariate polynomials over finite fields to evaluate the practicability of current factorization algorithms ("A Factorization Challenge", SIGSAM Bulletin 26(2):22-24, 1992). More recently, Victor Shoup has proposed an alternate family of polynomials with a similar goal in mind. Our effort is to take these challenges on using the general purpose computer algebra systems Maple and MuPAD. The result of our work are the factorizations of the von zur Gathen polynomials f n and of the Shoup polynomials F n for n from 1 to 500. We also present the factorization of the degree 1000 von zur Gathen polynomial f 1000.
Citations
| 48 | A new polynomial factorization algorithm and its implementation – Shoup - 1995 |
| 24 | User's Guide to PARI-GP – Batut, Bernardi, et al. - 1991 |
| 3 | In-Place arithmetic for polynomials over Z n – Monagan - 1993 |
| 3 | Von zur Gathen's factorization challenge – Monagan - 1993 |
