scientific article; zbMATH DE number 66619

MaRDI QIDQ4011252zbMATH OpenFDO

Authors A. L. Chistov

Publication date 27 September 1992

zbMATH Keywords

algorithmintegral basisNewton polygonspolynomial timefactoring multivariable polynomials over local fields

Mathematics Subject Classification ID

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

Recommendations

• Factoring polynomials over local fields.
• scientific article; zbMATH DE number 4035950
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Factoring polynomials over global fields. I
• Factoring multivariate polynomials over finite fields

Cited in

(16)

• Irreducibility testing over local fields
• Factoring polynomials over local fields.
• Factoring formal power series over principal ideal domains
• Generating random factored ideals in number fields
• Randomized polynomial-time root counting in prime power rings
• Single-factor lifting and factorization of polynomials over local fields
• Counting roots for polynomials modulo prime powers
• scientific article; zbMATH DE number 4035950 (Why is no real title available?)
• Factoring polynomials over global fields. I
• An algorithm of polynomial complexity for factoring polynomials over local fields
• Sentences over integral domains and their computational complexities
• Factoring multivariate polynomials via partial differential equations
• scientific article; zbMATH DE number 4144078 (Why is no real title available?)
• Factoring polynomials over local fields. II
• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
• Square-free OM computation of global integral bases

This page was built for publication:

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