Finding irreducible components of some real transcendental varieties

DOI10.1007/BF01202285zbMath0808.68065OpenAlexW2075528005MaRDI QIDQ1332661

Marie-Françoise Roy, Nikolaj N. jun. Vorob'ev

Publication date: 1 September 1994

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202285

zbMATH Keywords

\(E\)-polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Complexity lower bounds for computation trees with elementary transcendental function gates ⋮ Decision problem for a class of univariate Pfaffian functions ⋮ On irreducible components of real exponential hypersurfaces ⋮ Lower bound on testing membership to a polyhedron by algebraic decision and computation trees ⋮ Zero counting for a class of univariate Pfaffian functions ⋮ Computing roadmaps of semi-algebraic sets on a variety

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary structure of real algebraic varieties
• Solving systems of polynomial inequalities in subexponential time
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• Complexity of deciding Tarski algebra
• Computing the irreducible real factors and components of an algebraic curve
• Sur la complexité du principe de Tarski-Seidenberg

This page was built for publication: Finding irreducible components of some real transcendental varieties