Testing elementary function identities using CAD
From MaRDI portal
Publication:944998
DOI10.1007/s00200-007-0052-yzbMath1142.68618OpenAlexW1990320161WikidataQ59590621 ScholiaQ59590621MaRDI QIDQ944998
James C. Beaumont, James H. Davenport, Russell J. Bradford, Nalina Phisanbut
Publication date: 10 September 2008
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-007-0052-y
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cluster-based cylindrical algebraic decomposition algorithm
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- Counting connected components of a semialgebraic set in subexponential time
- A fast Euclidean algorithm for Gaussian integers
- Reasoning about the elementary functions of complex analysis
- A poly-algorithmic approach to simplifying elementary functions
- Efficient projection orders for CAD
- Adherence is better than adjacency
- On using bi-equational constraints in CAD construction
- Some undecidable problems involving elementary functions of a real variable
- Not seeing the roots for the branches
This page was built for publication: Testing elementary function identities using CAD