scientific article
From MaRDI portal
Publication:3983701
zbMath0764.14024MaRDI QIDQ3983701
Pablo Solernó, Joos Heintz, Marie-Françoise Roy
Publication date: 27 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
quantifier eliminationcomplexity boundsroadmap algorithmeffective computation of a semialgebraic path
Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Description of the connected components of a semialgebraic set in single exponential time
