Browse Code
The library computes the greatest common divisor of two univariate integer polynomials, whose coefficients are represented by multiple-precision integers provided by the GMP library. I wrote the code originally for CGAL, in 2007, but it was later removed for maintenance reasons.
Categories
MathematicsLicense
GNU Library or Lesser General Public License version 3.0 (LGPLv3)Follow tiny mug
You Might Also Like
Our Free Plans just got better! | Auth0 by Okta
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of tiny mug!