Automated simplification of large symbolic expressions
From MaRDI portal
Publication:2437298
DOI10.1016/j.jsc.2013.09.001zbMath1310.68259OpenAlexW2106764241MaRDI QIDQ2437298
David H. Bailey, Alexander D. Kaiser, Jonathan M. Borwein
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.09.001
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ten commandments for good default expression simplification
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
- A refined difference field theory for symbolic summation
- The evaluation of character Euler double sums
- Simplification of expressions involving radicals
- Advances on the simplification of sine-cosine equations
- SumCracker: A package for manipulating symbolic sums and related objects
- Parallel integer relation detection: Techniques and applications
- What is a Closed-Form Number?
- Higher-Dimensional Box Integrals
- Rational simplification modulo a polynomial ideal
- Advances in the theory of box integrals
- Solving low-density subset sum problems
- A new symbolic integration system in reduce
- A poly-algorithmic approach to simplifying elementary functions
- Log-Sine Evaluations of Mahler Measures, II
- Closed Forms: What They Are and Why We Care
- On Canonical Forms and Simplification
- Algebraic simplification
- On algebraic simplification
This page was built for publication: Automated simplification of large symbolic expressions