Description of the connected components of a semialgebraic set in single exponential time
From MaRDI portal
(Redirected from Publication:1317872)
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
Cites work
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 8550 (Why is no real title available?)
- scientific article; zbMATH DE number 27176 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3564960 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- Complexity of deciding Tarski algebra
- Construction of roadmaps in semi-algebraic sets
- Counting connected components of a semialgebraic set in subexponential time
- Finding connected components of a semialgebraic set in subexponential time
- 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. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Solving systems of polynomial inequalities in subexponential time
- Sur la complexité du principe de Tarski-Seidenberg
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
- scientific article; zbMATH DE number 21309 (Why is no real title available?)
- Finding connected components of a semialgebraic set in subexponential time
- scientific article; zbMATH DE number 589123 (Why is no real title available?)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
- Numerically computing real points on algebraic sets
- scientific article; zbMATH DE number 1262423 (Why is no real title available?)
- 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)
