scientific article; zbMATH DE number 1023365

Publication date: 7 September 1998

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

complexity multivariate polynomials number of real roots Hilbert's Nullstellensatz real roots of a polynomial algorithms in real algebraic geometry real counting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Semialgebraic sets and related spaces (14P10)

Related Items

Numbers of relative equilibria in the planar four-vortex problem: some special cases, Algorithms to compute the topology of orientable real algebraic surfaces, Pegasus: sound continuous invariant generation, Maxwell's conjecture on three point charges with equal magnitudes, Analytic expressions for the positive definite and unimodal regions of Gram-Charlier series, Unnamed Item, Further exploration into the valid regions of Gram-Charlier densities, Efficient and accurate computation of upper bounds of approximation errors, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, Separating linear forms and rational univariate representations of bivariate systems, A fast version of the Schur-Cohn algorithm., Finding at least one point in each connected component of a real algebraic set defined by a single equation, Sylvester-Habicht sequences and fast Cauchy index computation, On solving univariate sparse polynomials in logarithmic time, On the computation of an arrangement of quadrics in 3D, On affine complete intersections with isolated singularities., Simultaneous elimination by using several tools from real algebraic geometry, Recent advances on determining the number of real roots of parametric polynomials, An algebraic formula for the Euler characteristic of some semi-algebraic sets, Efficient topology determination of implicitly defined algebraic plane curves., On the numerical solution to two-fluid models via a cell-centered finite volume method, Real solving for positive dimensional systems., Systems of rational polynomial equations have polynomial size approximate zeros on the average