Uses of Class
edu.jas.gb.SigPoly
-
Packages that use SigPoly Package Description edu.jas.gb Groebner bases package. -
-
Uses of SigPoly in edu.jas.gb
Fields in edu.jas.gb declared as SigPoly Modifier and Type Field Description SigPoly<C>SigPair. piSigPoly<C>SigPair. pjFields in edu.jas.gb with type parameters of type SigPoly Modifier and Type Field Description java.util.List<SigPoly<C>>SigPair. GsMethods in edu.jas.gb that return SigPoly Modifier and Type Method Description (package private) SigPoly<C>GroebnerBaseArriSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.(package private) SigPoly<C>GroebnerBaseF5zSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.(package private) SigPoly<C>GroebnerBaseSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.SigPoly<C>SigReduction. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Normalform.SigPoly<C>SigReductionSeq. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.SigPoly<C>SigReductionSeq. sigSemiNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top semi-complete normalform.Methods in edu.jas.gb with parameters of type SigPoly Modifier and Type Method Description booleanSigReduction. isSigNormalform(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is in Normalform.booleanSigReductionSeq. isSigNormalform(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is in top normalform.booleanSigReduction. isSigReducible(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is top reducible.booleanSigReductionSeq. isSigReducible(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is top reducible.booleanSigReductionSeq. isSigRedundant(java.util.List<SigPoly<C>> G, SigPoly<C> A)Is sigma redundant.booleanSigReductionSeq. isSigRedundantAlt(java.util.List<SigPoly<C>> G, SigPoly<C> A)Is sigma redundant, alternative algorithm.(package private) SigPair<C>GroebnerBaseArriSigSeqIter. newPair(SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseArriSigSeqIter. newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseSigSeqIter. newPair(SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseSigSeqIter. newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPoly<C>GroebnerBaseArriSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.(package private) SigPoly<C>GroebnerBaseF5zSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.(package private) SigPoly<C>GroebnerBaseSigSeqIter. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.SigPoly<C>SigReduction. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Normalform.SigPoly<C>SigReductionSeq. sigNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top normalform.SigPoly<C>SigReductionSeq. sigSemiNormalform(java.util.List<GenPolynomial<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Top semi-complete normalform.(package private) GenPolynomial<C>GroebnerBaseGGVSigSeqIter. SPolynomial(SigPoly<C> A, SigPoly<C> B)S-Polynomial.(package private) GenPolynomial<C>GroebnerBaseSigSeqIter. SPolynomial(SigPoly<C> A, SigPoly<C> B)S-Polynomial.GenPolynomial<C>SigReduction. SPolynomial(SigPoly<C> Ap, SigPoly<C> Bp)S-Polynomial.GenPolynomial<C>SigReductionSeq. SPolynomial(SigPoly<C> A, SigPoly<C> B)S-Polynomial.ExpVector[]SigReductionSeq. SPolynomialExpVectorFactors(SigPoly<C> A, SigPoly<C> B)S-Polynomial factors.(package private) GenPolynomial<C>[]GroebnerBaseSigSeqIter. SPolynomialFactors(SigPoly<C> A, SigPoly<C> B)S-Polynomial polynomial factors.GenPolynomial<C>[]SigReductionSeq. SPolynomialFactors(SigPoly<C> A, SigPoly<C> B)S-Polynomial polynomial factors.GenPolynomial<C>SigReductionSeq. SPolynomialHalf(SigPoly<C> A, SigPoly<C> B)S-Polynomial half.(package private) voidGroebnerBaseArriSigSeqIter. updateSyz(java.util.List<ExpVector> syz, SigPoly<C> r)Update syzygy list.(package private) voidGroebnerBaseF5zSigSeqIter. updateSyz(java.util.List<ExpVector> syz, SigPoly<C> r)Update syzygy list.(package private) voidGroebnerBaseGGVSigSeqIter. updateSyz(java.util.List<ExpVector> syz, SigPoly<C> r)Update syzygy list.(package private) voidGroebnerBaseSigSeqIter. updateSyz(java.util.List<ExpVector> syz, SigPoly<C> r)Update syzygy list.Method parameters in edu.jas.gb with type arguments of type SigPoly Modifier and Type Method Description booleanSigReduction. isSigNormalform(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is in Normalform.booleanSigReductionSeq. isSigNormalform(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is in top normalform.booleanSigReduction. isSigReducible(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is top reducible.booleanSigReductionSeq. isSigReducible(java.util.List<SigPoly<C>> F, java.util.List<SigPoly<C>> G, SigPoly<C> A)Is top reducible.booleanSigReductionSeq. isSigRedundant(java.util.List<SigPoly<C>> G, SigPoly<C> A)Is sigma redundant.booleanSigReductionSeq. isSigRedundantAlt(java.util.List<SigPoly<C>> G, SigPoly<C> A)Is sigma redundant, alternative algorithm.(package private) SigPair<C>GroebnerBaseArriSigSeqIter. newPair(SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseArriSigSeqIter. newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseSigSeqIter. newPair(SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.(package private) SigPair<C>GroebnerBaseSigSeqIter. newPair(GenPolynomial<C> s, SigPoly<C> A, SigPoly<C> B, java.util.List<SigPoly<C>> G)Pair with signature.java.util.List<GenPolynomial<C>>SigReductionSeq. polys(java.util.List<SigPoly<C>> F)Select polynomials.Constructors in edu.jas.gb with parameters of type SigPoly Constructor Description SigPair(ExpVector sig, SigPoly<C> a, SigPoly<C> b, java.util.List<SigPoly<C>> Gs)SigPair constructor.SigPair(GenPolynomial<C> sig, SigPoly<C> a, SigPoly<C> b, java.util.List<SigPoly<C>> Gs)SigPair constructor.Constructor parameters in edu.jas.gb with type arguments of type SigPoly Constructor Description SigPair(ExpVector sig, SigPoly<C> a, SigPoly<C> b, java.util.List<SigPoly<C>> Gs)SigPair constructor.SigPair(GenPolynomial<C> sig, SigPoly<C> a, SigPoly<C> b, java.util.List<SigPoly<C>> Gs)SigPair constructor.
-