scientific article
From MaRDI portal
Publication:2739443
zbMath1006.11066MaRDI QIDQ2739443
David G. Cantor, Daniel M. Gordon
Publication date: 12 March 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials (11S05)
Related Items (17)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Factoring formal power series over principal ideal domains ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Faster \(p\)-adic feasibility for certain multivariate sparse polynomials ⋮ Counting roots for polynomials modulo prime powers ⋮ Single-factor lifting and factorization of polynomials over local fields ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Factoring Polynomials over Local Fields II ⋮ Factoring polynomials over local fields. ⋮ Unnamed Item ⋮ Solving polynomial systems over non-fields and applications to modular polynomial factoring ⋮ A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields ⋮ Toward a theory of Pollard's rho method ⋮ Randomized polynomial-time root counting in prime power rings ⋮ Factoring with Cyclotomic Polynomials
This page was built for publication: