Cylindrical algebraic decomposition I: the basic algorithm
SIAM Journal on Computing
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
Journal of Symbolic Computation
Quantifier elimination: Optimal solution for two classical examples
Journal of Symbolic Computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Testing stability by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Simplification of truth-invariant cylindrical algebraic decompositions
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On projection in CAD-based quantifier elimination with equational constraint
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Solving systems of strict polynomial inequalities
Journal of Symbolic Computation
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An improved projection operation for cylindrical algebraic decomposition (computer algebra, geometry, algorithms)
On order-invariance of a binomial over a nullifying cell
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A generic projection operator for partial cylindrical algebraic decomposition
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
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
On using bi-equational constraints in CAD construction
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Exact geometric-topological analysis of algebraic surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Developing a labelled object-relational constraint database architecture for the projection operator
Data & Knowledge Engineering
On the topology of planar algebraic curves
Proceedings of the twenty-fifth annual symposium on Computational geometry
On delineability of varieties in CAD-based quantifier elimination with two equational constraints
Proceedings of the 2009 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
Variant real quantifier elimination: algorithm and application
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Proceedings of the 2009 conference on Symbolic numeric computation
An efficient algorithm for the stratification and triangulation of an algebraic surface
Computational Geometry: Theory and Applications
Black-box/white-box simplification and applications to quantifier elimination
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing with semi-algebraic sets represented by triangular decomposition
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Topology of families of implicit algebraic surfaces depending on a parameter
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Quantifier elimination for quartics
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Variant quantifier elimination
Journal of Symbolic Computation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Robust stability for parametric linear ODEs
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
ACM Communications in Computer Algebra
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
Journal of Symbolic Computation
Theoretical Computer Science
Discovering polynomial Lyapunov functions for continuous dynamical systems
Journal of Symbolic Computation
Hi-index | 0.00 |
McCallum's projection operator for cylindrical algebraic decomposition (CAD) represented a huge step forward for the practical utility of the CAD algorithm. This paper presents a simple theorem showing that the mathematics in McCallum's paper actually point to a better projection operator than he proposes-a reduced McCallum projection. The reduced projection has the potential to not simply speed up CAD computation for problems that are currently solvable in practice, but actually increase the scope of problems that can realistically be attacked via CADs. Additionally, the same methods are used to show that McCallum's projection can be reduced still further when CAD is applied to certain types of commonly occurring quantifier elimination problems. Copyright 2001 Academic Press.