Comprehensive univariate polynomial class. All arithmetic performed symbolically. Some advanced features include: Arithmetic of polynomial rings over a finite field, the Tonelli-Shanks algorithm, GCD, exponentiation by squaring, irreducibility checking, modular arithmetic (obviously) and polynomials from roots.

Library for computing Gröbner Basis in .NET. Includes sample application that checks if a given graph is k-colorable using the API.