Factoring polynomials over local fields.
From MaRDI portal
Recommendations
- Factoring polynomials over local fields. II
- Factoring polynomials over global fields. I
- Factoring polynomials over global fields
- Factoring polynomials over global fields. II.
- scientific article; zbMATH DE number 66619
- scientific article; zbMATH DE number 4035950
- Factoring Polynomials over Algebraic Number Fields
- scientific article; zbMATH DE number 3858405
- An algorithm of polynomial complexity for factoring polynomials over local fields
- Factoring polynomials over finite fields
Cites work
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Asymptotically Fast Triangularization of Matrices over Rings
- Factoring Polynomials Over Large Finite Fields
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 1643926 (Why is no real title available?)
- scientific article; zbMATH DE number 1643932 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 3186965 (Why is no real title available?)
- Implementing the Round Four maximal order algorithm
- Modern computer algebra
- Subquadratic-time factoring of polynomials over finite fields
- The construction of maximal orders over a Dedekind domain
Cited in
(29)- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- Variation of the reduction type of elliptic curves under small base change with wild ramification
- Computing with quadratic forms over number fields
- Factoring polynomials over global fields. I
- Factoring polynomials over global fields. II.
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
- scientific article; zbMATH DE number 1643926 (Why is no real title available?)
- Genetics of polynomials over local fields
- Computing canonical heights using arithmetic intersection theory
- Division and slope factorization of p-adic polynomials
- Factoring formal power series over principal ideal domains
- An algorithm of polynomial complexity for factoring polynomials over local fields
- An efficient algorithm for factoring polynomials over algebraic extension field
- scientific article; zbMATH DE number 4035950 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- Efficient computation of maximal orders in radical (including Kummer) extensions
- Single-factor lifting and factorization of polynomials over local fields
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
- Higher Newton polygons and integral bases
- A solution to certain polynomial equations with applications to nonlinear fitting
- On the Complexity of the Montes Ideal Factorization Algorithm
- Factoring polynomials over local fields. II
- Complexity of OM factorizations of polynomials over local fields
- Newton polygons of higher order in algebraic number theory
- An algorithm for finding distinguished chains of polynomials
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Three-torsion subgroups and wild conductor exponents of plane quartics
- Plane curve germs and contact factorization
- Computing the local group of prime-power classes
This page was built for publication: Factoring polynomials over local fields.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950986)
