Algorithm of polynomial complexity for factoring polynomials over local fields

DOI10.1007/BF02112431zbMath0835.11047OpenAlexW2077346602MaRDI QIDQ1190956

Alexander L. Chistov

Publication date: 27 September 1992

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02112431

zbMATH Keywords

algorithmNewton polygonspolynomial timeintegral basisfactoring multivariable polynomials over local fields

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (5)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithm of polynomial complexity for factoring polynomials over local fields