Description of the connected components of a semialgebraic set in single exponential time
From MaRDI portal
Publication:1317872
DOI10.1007/BF02573999zbMATH Open0970.68201MaRDI QIDQ1317872FDOQ1317872
Authors: Joos Heintz, Marie-Françoise Roy, Pablo Solernó 
Publication date: 21 April 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131293
Recommendations
- scientific article; zbMATH DE number 27176
- Determination of the connected components of a semialgebraic set in subexponential time
- scientific article; zbMATH DE number 8550
- scientific article; zbMATH DE number 21309
- Finding connected components of a semialgebraic set in subexponential time
- Finding connected components of a semialgebraic set in subexponential time
- scientific article; zbMATH DE number 1262423
- Computing the homology of basic semialgebraic sets in weak exponential time
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Complexity of finding irreducible components of a semialgebraic set
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur la complexité du principe de Tarski-Seidenberg
- 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
- 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
- Complexity of deciding Tarski algebra
- Title not available (Why is that?)
- Construction of roadmaps in semi-algebraic sets
- Counting connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- Title not available (Why is that?)
- Finding connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
Cited In (12)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
- Reachability and connectivity queries in constraint databases
- Title not available (Why is that?)
- Finding connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
- Title not available (Why is that?)
- Numerically computing real points on algebraic sets
- Exact algorithms for linear matrix inequalities
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Computing the first Betti number of a semi-algebraic set
This page was built for publication: Description of the connected components of a semialgebraic set in single exponential time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317872)
