On sign conditions over real multivariate polynomials

DOI10.1007/s00454-009-9200-4zbMath1216.05055arXiv0801.0586MaRDI QIDQ977180

Gabriela Jeronimo, Juan Sabia, Daniel Perrucci

Publication date: 21 June 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.0586

zbMATH Keywords

complexity; sign conditions; consistency problem; real multivariate polynomials

Mathematics Subject Classification ID

05C31: Graph polynomials

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

Linear solving for sign determination, On the minimum of a positive polynomial over the standard simplex

Uses Software

• Kronecker
• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• On computing the determinant in small parallel time using a small number of processors
• Definability and fast quantifier elimination in algebraically closed fields
• Matrix multiplication via arithmetic progressions
• Deformation techniques for sparse systems
• The complexity of partial derivatives
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Counting connected components of a semialgebraic set in subexponential time
• Solving zero-dimensional systems through the rational univariate representation
• Lower bounds for diophantine approximations
• Polar varieties, real equation solving, and data structures: the hypersurface case
• Straight-line programs in geometric elimination theory
• Computing parametric geometric resolutions
• Real solving for positive dimensional systems.
• Deformation techniques for efficient polynomial equation solving.
• Generalized polar varieties: geometry and algorithms
• Testing sign conditions on a multivariate polynomial and applications
• A new decision method for elementary algebra
• Improved Algorithms for Sign Determination and Existential Quantifier Elimination
• On the combinatorial and algebraic complexity of quantifier elimination
• Sur la complexité du principe de Tarski-Seidenberg
• Algorithms in real algebraic geometry
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• A Gröbner free alternative for polynomial system solving
• Polar varieties and efficient real elimination