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
Other Useful Business Software
Get Avast Free Antivirus with 24/7 AI-powered online scam detection
Award-winning antivirus protection, as well as protection against online scams, dangerous Wi-Fi connections, hacked accounts, and ransomware. It includes Avast Assistant, your built-in AI partner, which gives you help with suspicious online messages, offers, and more.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of tiny mug!