Generic implementation of a modular gcd over algebraic extension fields

Dominik Huelse, Michael Hemmer

Research output: Contribution to conferenceConference Paperpeer-review

27 Downloads (Pure)

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.
Original languageEnglish
Number of pages3
Publication statusPublished - 16 Mar 2009
Event25th European Workshop on Computational Geometry - Université Libre de Bruxelles, Brussels, Belgium
Duration: 16 Mar 200918 Mar 2009

Conference

Conference25th European Workshop on Computational Geometry
CountryBelgium
CityBrussels
Period16/03/0918/03/09

Fingerprint

Dive into the research topics of 'Generic implementation of a modular gcd over algebraic extension fields'. Together they form a unique fingerprint.

Cite this