Abstract
We report on several generic implementations for univariate polynomial gcd computation over the integers and, in particular, over algebraic extensions. Our
benchmarks show that the generic implementation compares favorably to well established libraries. Even for the integer case our implementation is competitive
to the one provided by the NTL, which does not support algebraic extensions. Our software is part of the new Polynomial package of Cgal release 3.4.
benchmarks show that the generic implementation compares favorably to well established libraries. Even for the integer case our implementation is competitive
to the one provided by the NTL, which does not support algebraic extensions. Our software is part of the new Polynomial package of Cgal release 3.4.
Original language | English |
---|---|
Number of pages | 3 |
Publication status | Published - 16 Mar 2009 |
Event | 25th European Workshop on Computational Geometry - Université Libre de Bruxelles, Brussels, Belgium Duration: 16 Mar 2009 → 18 Mar 2009 |
Conference
Conference | 25th European Workshop on Computational Geometry |
---|---|
Country/Territory | Belgium |
City | Brussels |
Period | 16/03/09 → 18/03/09 |