Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
Journal of Symbolic Computation
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Guaranteed solution formula construction
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Solving systems of strict polynomial inequalities
Journal of Symbolic Computation
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Non-linear loop invariant generation using Gröbner bases
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
On using bi-equational constraints in CAD construction
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Lifting techniques for triangular decompositions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Real solution isolation using interval arithmetic
Computers & Mathematics with Applications
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing cylindrical algebraic decomposition via triangular decomposition
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algebraic Complexity Theory
Computing with semi-algebraic sets represented by triangular decomposition
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Algorithms for computing triangular decompositions of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Finding points on real solution components and applications to differential polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue: semi-algebraic systems. We show that any such system can be decomposed into finitely many regular semi-algebraic systems. We propose two specifications (full and lazy) of such a decomposition and present corresponding algorithms. Under some simplifying assumptions, the lazy decomposition can be computed in singly exponential time w.r.t. the number of variables. We have implemented our algorithms and present experimental results illustrating their effectiveness.