On order-invariance of a binomial over a nullifying cell
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
A poly-algorithmic approach to simplifying elementary functions
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
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast simplifications for Tarski formulas
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
Black-box/white-box simplification and applications to quantifier elimination
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Mathematics and Computers in Simulation
Solving parametric piecewise polynomial systems
Journal of Computational and Applied Mathematics
Efficient preprocessing methods for quantifier elimination
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
An algorithm for computing the complete root classification of a parametric polynomial
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Quantifier elimination for quartics
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
| Hi-index | 0.00 |