AdamWhiteHat / Polynomial Public

Notifications You must be signed in to change notification settings
Fork 3
Star 10

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.

10 stars 3 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
SparsePolynomial		SparsePolynomial
.gitignore		.gitignore
README.md		README.md

Repository files navigation

SparsePolynomial

Univariate polynomial class that only tracks non-zero terms.

Supports: Univariate polynomial arithmetic including addition, subtraction, multiplication, division, modulus, exponentiation, and GCD.

Other methods of interest: Eulers Criterion Legendre Symbol and Legendre Symbol Search Tonelli-Shanks Chinese Remainder Theorem

About

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.

csharp math polynomials symbolic arithmetic polynomial gcd exponentiation polynomial-arithmetic symbolic-math modulus square-root legendre-symbol polynomial-rings generic-arithmetic-types biginteger-integer

Report repository

Releases

No releases published

Sponsor this project

Packages

No packages published

Languages

C# 100.0%