Algorithm of polynomial complexity for factoring polynomials over local fields

DOI10.1007/BF02112431MaRDI QIDQ1190956zbMATH OpenOpenAlexFDO

Authors A. 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

algorithmfactoring multivariable polynomials over local fieldsintegral basisNewton polygonspolynomial time

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0761.11046.

Cited in

(7)

• Computing the multilinear factors of lacunary polynomials without heights
• Efficiently factoring polynomials modulo \(p^4\)
• Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
• Counting basic-irreducible factors \(\operatorname{mod} p^k\) in deterministic poly-time and \(p\)-adic applications
• Algorithmic local monomialization of a binomial: A comparison of different approaches
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
• Solving polynomial systems over non-fields and applications to modular polynomial factoring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190956)