Branch cuts in computer algebra
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Towards better simplification of elementary functions
Proceedings of the 2002 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
Adherence is better than adjacency: computing the Riemann index using CAD
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Testing elementary function identities using CAD
Applicable Algebra in Engineering, Communication and Computing
Computing cylindrical algebraic decomposition via triangular decomposition
Proceedings of the 2009 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
Computing the real solutions of polynomial systems with the RegularChains library in Maple
ACM Communications in Computer Algebra
Cylindrical algebraic decompositions for boolean combinations
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Understanding branch cuts of expressions
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |