Complexity of finding irreducible components of a semialgebraic set

DOI10.1006/jcom.1995.1007zbMath0821.14037OpenAlexW2094402074MaRDI QIDQ1346599

Nikolaj N. jun. Vorob'ev, Andre Galligo

Publication date: 5 April 1995

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

Full work available at URL: https://doi.org/10.1006/jcom.1995.1007

zbMATH Keywords

algorithmcomplexificationsemialgebraic setirreducible componentsZariski closure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Computational aspects in algebraic geometry (14Q99)

Related Items (6)

A semi-algebraic version of Zarankiewicz's problem ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Ax-Lindemann for \(\mathcal{A}_g\) ⋮ ON THE IRREDUCIBLE COMPONENTS OF A SEMIALGEBRAIC SET ⋮ The André–Oort conjecture for the moduli space of abelian surfaces ⋮ Generators for the \(C^m\)-closures of ideals

This page was built for publication: Complexity of finding irreducible components of a semialgebraic set