Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CORR
2008
Springer

favoriteEmaildiscussreport

92views Education» more CORR 2008»

On sign conditions over real multivariate polynomials

13 years 4 months ago

On sign conditions over real multivariate polynomials

Download mate.dm.uba.ar

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions over the polynomials. In addition, we extend these results to the case of closed sign conditions over an arbitrary family of real multivariate polynomials. The complexity bounds for these procedures improve the known ones.

Gabriela Jeronimo, Daniel Perrucci, Juan Sabia

Real-time Traffic

CORR 2008 | Education | Feasible Sign Conditions | Polynomials | Sign Conditions |

claim paper

Related Content

» Testing Sign Conditions on a Multivariate Polynomial and Applications

» On the probability distribution of data at points in real complete intersection varieties

» Refined bounds on the number of connected components of sign conditions on a variety

» Minimizing Polynomials via Sum of Squares over the Gradient Ideal

» A New Method for Real Root Isolation of Univariate Polynomials

» Shallow Circuits with HighPowered Inputs

» Parametric Linear Arithmetic over Ordered Fields in IsabelleHOL

» A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials

» The DMM bound multivariate aggregate separation bounds

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Gabriela Jeronimo, Daniel Perrucci, Juan Sabia

Comments (0)