public final class DistinctDegreeFactorization extends Object
Modifier and Type | Method and Description |
---|---|
static <Poly extends IUnivariatePolynomial<Poly>> |
DistinctDegreeFactorization(Poly poly)
Performs distinct-degree factorization for square-free polynomial
poly . |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorization(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly . |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorizationPlain(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly using plain incremental exponents
algorithm. |
static PolynomialFactorDecomposition<UnivariatePolynomialZp64> |
DistinctDegreeFactorizationPrecomputedExponents(UnivariatePolynomialZp64 poly)
Performs distinct-degree factorization for square-free polynomial
poly using plain incremental exponents
algorithm with precomputed exponents. |
static <Poly extends IUnivariatePolynomial<Poly>> |
DistinctDegreeFactorizationShoup(Poly poly)
Performs distinct-degree factorization for square-free polynomial
poly using Victor Shoup's baby step /
giant step algorithm. |
public static PolynomialFactorDecomposition<UnivariatePolynomialZp64> DistinctDegreeFactorizationPlain(UnivariatePolynomialZp64 poly)
poly
using plain incremental exponents
algorithm.
In the case of not square-free input, the algorithm works, but the resulting d.d.f. may be incomplete.
poly
- the polynomialpoly
public static PolynomialFactorDecomposition<UnivariatePolynomialZp64> DistinctDegreeFactorizationPrecomputedExponents(UnivariatePolynomialZp64 poly)
poly
using plain incremental exponents
algorithm with precomputed exponents.
In the case of not square-free input, the algorithm works, but the resulting d.d.f. may be incomplete.
poly
- the polynomialpoly
public static <Poly extends IUnivariatePolynomial<Poly>> PolynomialFactorDecomposition<Poly> DistinctDegreeFactorizationShoup(Poly poly)
poly
using Victor Shoup's baby step /
giant step algorithm.
In the case of not square-free input, the algorithm works, but the resulting d.d.f. may be incomplete.
poly
- the polynomialpoly
public static PolynomialFactorDecomposition<UnivariatePolynomialZp64> DistinctDegreeFactorization(UnivariatePolynomialZp64 poly)
poly
.
In the case of not square-free input, the algorithm works, but the resulting d.d.f. may be incomplete.
poly
- the polynomialpoly
public static <Poly extends IUnivariatePolynomial<Poly>> PolynomialFactorDecomposition<Poly> DistinctDegreeFactorization(Poly poly)
poly
.
In the case of not square-free input, the algorithm works, but the resulting d.d.f. may be incomplete.
poly
- the polynomialpoly
Copyright © 2017. All rights reserved.