{"date_updated":"2023-03-06T09:10:34Z","year":"2009","language":[{"iso":"eng"}],"title":"The van Hoeij Algorithm for Factoring Polynomials","publication_identifier":{"isbn":["9783642022944","9783642022951"],"issn":["1619-7100"]},"_id":"35959","citation":{"ama":"Klüners J. The van Hoeij Algorithm for Factoring Polynomials. In: <i>The LLL Algorithm</i>. Springer Berlin Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-02295-1_8\">10.1007/978-3-642-02295-1_8</a>","apa":"Klüners, J. (2009). The van Hoeij Algorithm for Factoring Polynomials. In <i>The LLL Algorithm</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-02295-1_8\">https://doi.org/10.1007/978-3-642-02295-1_8</a>","short":"J. Klüners, in: The LLL Algorithm, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.","mla":"Klüners, Jürgen. “The van Hoeij Algorithm for Factoring Polynomials.” <i>The LLL Algorithm</i>, Springer Berlin Heidelberg, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-02295-1_8\">10.1007/978-3-642-02295-1_8</a>.","ieee":"J. Klüners, “The van Hoeij Algorithm for Factoring Polynomials,” in <i>The LLL Algorithm</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.","bibtex":"@inbook{Klüners_2009, place={Berlin, Heidelberg}, title={The van Hoeij Algorithm for Factoring Polynomials}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-02295-1_8\">10.1007/978-3-642-02295-1_8</a>}, booktitle={The LLL Algorithm}, publisher={Springer Berlin Heidelberg}, author={Klüners, Jürgen}, year={2009} }","chicago":"Klüners, Jürgen. “The van Hoeij Algorithm for Factoring Polynomials.” In <i>The LLL Algorithm</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02295-1_8\">https://doi.org/10.1007/978-3-642-02295-1_8</a>."},"place":"Berlin, Heidelberg","author":[{"id":"21202","full_name":"Klüners, Jürgen","last_name":"Klüners","first_name":"Jürgen"}],"publisher":"Springer Berlin Heidelberg","abstract":[{"text":"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.","lang":"eng"}],"user_id":"93826","date_created":"2023-01-11T09:48:17Z","department":[{"_id":"102"}],"related_material":{"link":[{"url":"https://www.researchgate.net/profile/Juergen-Klueners/publication/226764840_The_van_Hoeij_Algorithm_for_Factoring_Polynomials/links/00463532f2216a64ae000000/The-van-Hoeij-Algorithm-for-Factoring-Polynomials.pdf?origin=publication_detail","relation":"confirmation"}]},"doi":"10.1007/978-3-642-02295-1_8","publication":"The LLL Algorithm","status":"public","publication_status":"published","type":"book_chapter"}