scientific article; zbMATH DE number 66619
From MaRDI portal
Publication:4011252
zbMATH Open0761.11045MaRDI QIDQ4011252FDOQ4011252
Authors: A. L. Chistov
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
algorithmintegral basisNewton polygonspolynomial timefactoring multivariable polynomials over local fields
Polynomials (11S05) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
Cited In (16)
- Irreducibility testing over local fields
- Randomized polynomial-time root counting in prime power rings
- Counting roots for polynomials modulo prime powers
- Single-factor lifting and factorization of polynomials over local fields
- Title not available (Why is that?)
- Factoring polynomials over local fields.
- Generating random factored ideals in number fields
- Title not available (Why is that?)
- Factoring polynomials over local fields. II
- Factoring multivariate polynomials via partial differential equations
- An algorithm of polynomial complexity for factoring polynomials over local fields
- Square-free OM computation of global integral bases
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
- Factoring formal power series over principal ideal domains
- Sentences over integral domains and their computational complexities
- Factoring polynomials over global fields. I
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)