New Resultant Inequalities and Complex Polynomial Factorization

DOI10.1137/S0097539792235712zbMath0822.12005OpenAlexW2048792222MaRDI QIDQ4312416

Pan, Victor Y.

Publication date: 23 October 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792235712

zbMATH Keywords

computational complexityzerospolynomialspolynomial factorizationapproximate factorizationparallel computingrandomized algorithmsresultantdeterministic algorithmcomplex fieldprobabilistic estimatesmonic univariate polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros

This page was built for publication: New Resultant Inequalities and Complex Polynomial Factorization