The van Hoeij Algorithm for Factoring Polynomials
J. Klüners, in: The LLL Algorithm, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
Download
No fulltext has been uploaded.
Book Chapter
| Published
| English
Author
Department
Abstract
In this survey, we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial problem that occurs in the Zassenhaus algorithm is reduced to a very special knapsack problem. In case of rational polynomials, this knapsack problem can be very efficiently solved by the LLL algorithm. This gives a polynomial time algorithm, which also works very well in practice.
Publishing Year
Book Title
The LLL Algorithm
ISBN
ISSN
LibreCat-ID
Cite this
Klüners J. The van Hoeij Algorithm for Factoring Polynomials. In: The LLL Algorithm. Springer Berlin Heidelberg; 2009. doi:10.1007/978-3-642-02295-1_8
Klüners, J. (2009). The van Hoeij Algorithm for Factoring Polynomials. In The LLL Algorithm. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-02295-1_8
@inbook{Klüners_2009, place={Berlin, Heidelberg}, title={The van Hoeij Algorithm for Factoring Polynomials}, DOI={10.1007/978-3-642-02295-1_8}, booktitle={The LLL Algorithm}, publisher={Springer Berlin Heidelberg}, author={Klüners, Jürgen}, year={2009} }
Klüners, Jürgen. “The van Hoeij Algorithm for Factoring Polynomials.” In The LLL Algorithm. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-02295-1_8.
J. Klüners, “The van Hoeij Algorithm for Factoring Polynomials,” in The LLL Algorithm, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
Klüners, Jürgen. “The van Hoeij Algorithm for Factoring Polynomials.” The LLL Algorithm, Springer Berlin Heidelberg, 2009, doi:10.1007/978-3-642-02295-1_8.
Google Scholar
ISBN Search