Additive Complexity and Zeros of Real Polynomials

DOI10.1137/0214014zbMath0562.12020OpenAlexW2052901292MaRDI QIDQ5187376

Jean-Jacques Risler

Publication date: 1985

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

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

zbMATH Keywords

real polynomialadditive complexitynumber of distinct real zeros

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Polynomials over commutative rings (13B25) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (11)

Computability of the additive complexity of algebraic circuits with root extracting ⋮ On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\). ⋮ Bezout theorem for Nash functions ⋮ Topologie des hypersurfaces pfaffiennes ⋮ Constraints on the angular distribution of the zeros of a polynomial of low complexity ⋮ Test complexity of generic polynomials ⋮ Verification complexity of linear prime ideals ⋮ On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem ⋮ Some aspects of complexity in real algebraic geometry ⋮ Intersection multiplicity of a sparse curve and a low-degree curve ⋮ Testing polynomials

This page was built for publication: Additive Complexity and Zeros of Real Polynomials