Publication | Open Access
Factoring polynomials over global fields
11
Citations
3
References
2004
Year
EngineeringComputational Number TheoryFinite FieldAlgebraic MethodEfficient AlgorithmComputational ComplexityTime ComplexityGlobal FieldsApplied AlgebraGlobal FieldApproximation TheoryPolynomial Time
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
| Year | Citations | |
|---|---|---|
Page 1
Page 1