scientific article
From MaRDI portal
Publication:4011252
zbMath0761.11045MaRDI QIDQ4011252
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmNewton polygonspolynomial timeintegral basisfactoring multivariable polynomials over local fields
Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Polynomials (11S05)
Related Items (10)
Factoring multivariate polynomials via partial differential equations ⋮ Factoring formal power series over principal ideal domains ⋮ Square-free OM computation of global integral bases ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ Counting roots for polynomials modulo prime powers ⋮ Generating random factored ideals in number fields ⋮ Factoring polynomials over local fields. ⋮ Irreducibility testing over local fields ⋮ Randomized polynomial-time root counting in prime power rings ⋮ Sentences over integral domains and their computational complexities
This page was built for publication:
