scientific article; zbMATH DE number 66619

MaRDI QIDQ4011252zbMATH OpenFDO

Authors A. L. Chistov

Publication date 27 September 1992

zbMATH Keywords

algorithmfactoring multivariable polynomials over local fieldsintegral basisNewton polygonspolynomial time

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

(19)

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

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)