Cylindrical algebraic decomposition II: an adjacency algorithm for the plane
SIAM Journal on Computing
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
A cluster-based cylindrical algebraic decomposition algorithm
Journal of Symbolic Computation
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
“According to Abramowitz and Stegun” or arccoth needn't be uncouth
ACM SIGSAM Bulletin - Special issue of OpenMath
An Assume Facility for CAS, with a Sample Implementation for Maple
DISCO '92 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Mathematics of Computation
Towards better simplification of elementary functions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A new zero-test for formal power series
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
A poly-algorithmic approach to simplifying elementary functions
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Understanding expression simplification
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Not seeing the roots for the branches: multivalued functions in computer algebra
ACM SIGSAM Bulletin
Adherence is better than adjacency: computing the Riemann index using CAD
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Understanding branch cuts of expressions
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Automated simplification of large symbolic expressions
Journal of Symbolic Computation
Hi-index | 0.00 |
In [5], we introduced an algorithm for deciding whether a proposed simplification of elementary functions was correct in the presence of branch cuts. This algorithm used multivalued function simplification followed by verification that the branches were consistent.In [14] an algorithm was presented for zero-testing functions defined by ordinary differential equations, in terms of their power series.The purpose of the current paper is to investigate merging the two techniques. In particular, we will show an explicit reduction to the constant problem [16].