A poly-algorithmic approach to simplifying elementary functions

DOI10.1145/1005285.1005292zbMath1134.68594OpenAlexW2021362627MaRDI QIDQ4657297

James C. Beaumont, Nalina Phisanbut, James H. Davenport, Russell J. Bradford

Publication date: 14 March 2005

Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1005285.1005292

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

Automated simplification of large symbolic expressions ⋮ Testing elementary function identities using CAD

Uses Software

• QEPCAD

This page was built for publication: A poly-algorithmic approach to simplifying elementary functions