Решение алгебраических уравнений любой степени с заданной точностью
-
Updated
Jun 28, 2021 - C#
Решение алгебраических уравнений любой степени с заданной точностью
A complex polynomial arithmetic class..
Символьные вычисления
Graph ADT and shortest path algorithms + Polynomials ADT and CRC algorithm
Task02. Operations_overload
a library for Polynomial equation manipulations
Finding Roots of a Polynomial using c#
A symbolic, multivariate integer polynomial arithmetic library.
Creates a counting system of radixes such as base 12 or mixed radixes such as Minutes/Hours/Days/Years (60/60/24/365)
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.
Add a description, image, and links to the polynomials topic page so that developers can more easily learn about it.
To associate your repository with the polynomials topic, visit your repo's landing page and select "manage topics."