Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Properties of Gröbner bases under specializations
EUROCAL '87 Proceedings of the European Conference on Computer Algebra
Solving systems of algebraic equations by using Gröbner bases
EUROCAL '87 Proceedings of the European Conference on Computer Algebra
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Efficient projection orders for CAD
ISSAC '04 Proceedings of the 2004 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
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Optimising problem formulation for cylindrical algebraic decomposition
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
Gröbner Bases [Buc70] and Cylindrical Algebraic Decomposition [Col75,CMMXY09] are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a mixed system of equalities and inequalities, it is possible to apply Gröbner bases to the (conjoined) equalities before invoking CAD. We see that this is, quite often but not always, a beneficial preconditioning of the CAD problem. It is also possible to precondition the (conjoined) inequalities with respect to the equalities, and this can also be useful in many cases.