scientific article

zbMath0689.12014MaRDI QIDQ3031075

Carlo Traverso, Roberto Dvornicich

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

root separationalgebraically closed fieldsabsolute irreducibility testalgorithm for absolute factorizationcomplexity of operationsNewton symmetric functionsroots at polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special polynomials in general fields (12E10)

Related Items

Lifting and recombination techniques for absolute factorization ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ Unnamed Item ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ Fast computation of special resultants ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Computing the irreducible real factors and components of an algebraic curve ⋮ Probabilistic absolute irreducibility test for polynomials