Triangular decomposition of semi-algebraic systems (Q5917866)

Triangular decompositions of systems of polynomial equations produce as outputs \textit{regular chains.} The paper under review introduces the notion of \textit{regular semi-algebraic systems}, which should be regarded as the real (i.e., over \({\mathbb R}\)) counterpart of these regular chains. Two notions of a decomposition of a semi-algebraic system are then defined: one called \textit{lazy} where the analysis of components of strictly smaller dimension is deferred, and another called \textit{full} including all the cases. The authors provide running time estimates for computing these decompositions, and their implementations and experimental results are described at the end of the paper.