Complexity of finding irreducible components of a semialgebraic set
From MaRDI portal
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 21309 (Why is no real title available?)
- Finding connected components of a semialgebraic set in subexponential time
- ON THE IRREDUCIBLE COMPONENTS OF A SEMIALGEBRAIC SET
- Generators for the \(C^m\)-closures of ideals
- scientific article; zbMATH DE number 1254270 (Why is no real title available?)
- Computing real radicals and \(S\)-radicals of polynomial systems
- The André-Oort conjecture for the moduli space of abelian surfaces
- A semi-algebraic version of Zarankiewicz's problem
- scientific article; zbMATH DE number 1262423 (Why is no real title available?)
- Ax-Lindemann for \(\mathcal{A}_g\)
- Computing real radicals by moment optimization
- Complexity of computing the local dimension of a semialgebraic set
- Description of the connected components of a semialgebraic set in single exponential time
- The complexity of irredundant sets parameterized by size
This page was built for publication: Complexity of finding irreducible components of a semialgebraic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346599)
