Efficient Multivariate Factorization over Finite Fields
TL;DR: The Maple implementation of multivariate factorization over general finite fields is described and selected details of the algorithms and several ideas that were used to improve its efficiency are shown.
read more
Abstract: We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Handbook of Finite Fields
Gary L. Mullen,Daniel Panario +1 more
- 17 Jun 2013
TL;DR: The Handbook of Finite Fields describes various mathematical and practical applications of finite fields in combinatorics, algebraic coding theory, cryptographic systems, biology, quantum information theory, engineering, and other areas.
351
Fast separable factorization and applications
TL;DR: It is shown that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations in the coefficient field, using the classical multi-modular strategy.
35
Maple on a massively parallel, distributed memory machine
Laurent Bernardin
- 20 Jul 1997
TL;DR: This work ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine, and extended the Maple kernel with a set of message pawing primitives baaed on the Paragon’s native message passing library to take advantage of the parallel architecture.
24
Factorization of multivariate polynomials over finite fields
Laurent Fernand Guy Bernardin
- 01 Jan 1999
TL;DR: In this paper, Zusammenfassung et al. presented a method to solve the problem of ZUSAMMENFASSUN.xv ZUSammenFassung
24
References
•Proceedings Article
Proceedings of the 30th IEEE symposium on Foundations of computer science
Zvi Galil,E. K. Blum +1 more
- 01 Dec 1994
628
A new algorithm for factoring polynomials over finite fields
David G. Cantor,Hans Zassenhaus +1 more
TL;DR: A new probabilistic method is presented which, when combined with the above algorithms, avoids the need for both resultants and linear equations and leads to algorithms which are conceptually simpler than previous methods.
•Book
Axiom : the scientific computation system
Richard D. Jenks,Robert S. Sutor +1 more
- 20 Aug 1992
TL;DR: This book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques.
287
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
Erich Kaltofen,Barry M. Trager +1 more
TL;DR: It is shown that within this black box representation the polynomial greatest common divisor and factorization problems, as well as the problem of extracting the numerator and denominator of a rational function, can all be solved in randomPolynomial-time.
227
A new polynomial factorization algorithm and its implementation
TL;DR: It is demonstrated that the new baby step/giant step factoring method, recently developed by Kaltofen and Shoup, can be made into a very practical algorithm.
136