---
res:
bibo_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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Jürgen
foaf_name: Klüners, Jürgen
foaf_surname: Klüners
foaf_workInfoHomepage: http://www.librecat.org/personId=21202
bibo_doi: 10.1007/978-3-642-02295-1_8
dct_date: 2009^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/1619-7100
- http://id.crossref.org/issn/9783642022944
- http://id.crossref.org/issn/9783642022951
dct_language: eng
dct_publisher: Springer Berlin Heidelberg@
dct_title: The van Hoeij Algorithm for Factoring Polynomials@
...