Uses of Interface
edu.jas.arith.Modular
Packages that use Modular
Package
Description
Basic arithmetic package.
Generic coefficients polynomial package.
Unique factorization domain package.
-
Uses of Modular in edu.jas.arith
Classes in edu.jas.arith with type parameters of type ModularModifier and TypeInterfaceDescriptioninterfaceModularRingFactory<C extends RingElem<C> & Modular>Modular ring factory interface.Classes in edu.jas.arith that implement ModularModifier and TypeClassDescriptionfinal classModInt class with RingElem interface.final classModInteger class with GcdRingElem interface.final classModLong class with RingElem interface. -
Uses of Modular in edu.jas.poly
Classes in edu.jas.poly with type parameters of type ModularModifier and TypeClassDescription(package private) classModSymToInt<C extends RingElem<C> & Modular>Conversion of symmetric ModInteger to BigInteger functor.(package private) classConversion of ModInteger to BigInteger functor.Methods in edu.jas.poly with type parameters of type ModularModifier and TypeMethodDescriptionstatic <C extends RingElem<C> & Modular>
GenPolynomial<C> PolyUtil.chineseRemainder(GenPolynomialRing<C> fac, GenPolynomial<C> A, C mi, GenPolynomial<C> B) ModInteger chinese remainder algorithm on coefficients.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
List<GenPolynomial<BigInteger>> PolyUtil.integerFromModularCoefficients(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficientsPositive(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, positive. -
Uses of Modular in edu.jas.ufd
Classes in edu.jas.ufd with type parameters of type ModularModifier and TypeClassDescriptionclassFactorInteger<MOD extends GcdRingElem<MOD> & Modular>Integer coefficients factorization algorithms.classFactorModular<MOD extends GcdRingElem<MOD> & Modular>Modular coefficients factorization algorithms.classGreatestCommonDivisorHensel<MOD extends GcdRingElem<MOD> & Modular>Greatest common divisor algorithms with subresultant polynomial remainder sequence and univariate Hensel lifting.classGreatestCommonDivisorModEval<MOD extends GcdRingElem<MOD> & Modular>Greatest common divisor algorithms with modular evaluation algorithm for recursion.classGreatestCommonDivisorModular<MOD extends GcdRingElem<MOD> & Modular>Greatest common divisor algorithms with modular computation and Chinese remainder algorithm.classHenselApprox<MOD extends GcdRingElem<MOD> & Modular>Container for the approximation result from a Hensel algorithm.Methods in edu.jas.ufd with type parameters of type ModularModifier and TypeMethodDescriptionstatic <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isDiophantLift(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S1, GenPolynomial<MOD> S2, GenPolynomial<MOD> C) Modular Diophant relation lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isDiophantLift(List<GenPolynomial<MOD>> A, List<GenPolynomial<MOD>> S, GenPolynomial<MOD> C) Modular Diophant relation lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isExtendedEuclideanLift(List<GenPolynomial<MOD>> A, List<GenPolynomial<MOD>> S) Modular extended Euclidean relation lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselMultUtil.isHenselLift(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<GenPolynomial<MOD>> L) Modular Hensel lifting algorithm on coefficients test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isHenselLift(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, HenselApprox<MOD> Ha) Modular Hensel lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, List<MOD> V, long d, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, List<MOD> V, long d, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long e, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftDiophant(GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> C, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, long e, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftDiophant(List<GenPolynomial<MOD>> A, GenPolynomial<MOD> C, long k) Modular diophantine equation solution and lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
GenPolynomial<MOD>[]HenselUtil.liftExtendedEuclidean(GenPolynomial<MOD> A, GenPolynomial<MOD> B, long k) Constructing and lifting algorithm for extended Euclidean relation.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftExtendedEuclidean(List<GenPolynomial<MOD>> A, long k) Constructing and lifting algorithm for extended Euclidean relation.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHensel(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G) Modular Hensel lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftHensel(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHenselFull(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G) Modular Hensel full lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHenselMonic(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k) Modular Hensel lifting algorithm, monic case.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftHenselMonic(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.