| FDUtil |
Solvable polynomials factorization domain utilities, for example recursive
pseudo remainder.
|
| FDUtilQuatTest |
FDUtilQuat tests with JUnit.
|
| FDUtilTest |
FDUtil tests with JUnit.
|
| GCDFakeTest |
GCD Fake PRS algorithm tests with JUnit.
|
| GCDPrimitiveQuatTest |
GCD Primitive PRS algorithm tests with JUnit.
|
| GCDPrimitiveTest |
GCD Primitive PRS algorithm tests with JUnit.
|
| GCDSimpleQuatTest |
GCD Simple PRS algorithm tests with JUnit.
|
| GCDSimpleTest |
GCD Simple PRS algorithm tests with JUnit.
|
| GCDSyzygyTest |
GCD via syzygy tests with JUnit.
|
| GreatestCommonDivisorAbstract<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms.
|
| GreatestCommonDivisorFake<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with monic polynomial remainder sequence.
|
| GreatestCommonDivisorPrimitive<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with primitive polynomial remainder sequence.
|
| GreatestCommonDivisorSimple<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with monic polynomial remainder sequence.
|
| GreatestCommonDivisorSyzygy<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with syzygy computation.
|
| QuotSolvablePolynomial<C extends GcdRingElem<C>> |
QuotSolvablePolynomial generic recursive solvable polynomials implementing
RingElem. n-variate ordered solvable polynomials over solvable polynomial
coefficients.
|
| QuotSolvablePolynomialRing<C extends GcdRingElem<C>> |
QuotSolvablePolynomialRing generic recursive solvable polynomial factory
implementing RingFactory and extending GenSolvablePolynomialRing factory.
|
| QuotSolvablePolynomialTest |
BigRational coefficients QuotSolvablePolynomial tests with JUnit.
|
| SGCDFactory |
Solvable greatest common divisor algorithms factory.
|
| SGCDFactoryTest |
Solvable GreatestCommonDivisor factory tests with JUnit.
|
| SGCDParallelProxy<C extends GcdRingElem<C>> |
Solvable greatest common divisor parallel proxy.
|
| SGCDParallelProxyTest |
Solvable GreatestCommonDivisor parallel proxy tests with JUnit.
|
| SolvableQuotient<C extends GcdRingElem<C>> |
SolvableQuotient, that is a (left) rational function, based on
GenSolvablePolynomial with RingElem interface.
|
| SolvableQuotientRing<C extends GcdRingElem<C>> |
SolvableQuotient ring factory based on GenPolynomial with RingElem interface.
|
| SolvableQuotientTest |
SolvableQuotient over BigRational GenSolvablePolynomial tests with JUnit.
|