Equality in computer algebra and beyond.
From MaRDI portal
Publication:1404423
DOI10.1006/jsco.2002.0551zbMath1037.68161OpenAlexW1982013717WikidataQ59590626 ScholiaQ59590626MaRDI QIDQ1404423
Publication date: 21 August 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2002.0551
Related Items (max. 100)
Hidden verification for computational mathematics ⋮ Retargeting OpenAxiom to Poly/ML: Towards an Integrated Proof Assistants and Computer Algebra System Framework ⋮ A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy ⋮ Effective Set Membership in Computer Algebra and Beyond
Uses Software
Cites Work
- Formal and efficient primality proofs by use of computer algebra oracles
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Probabilistic algorithm for testing primality
- The Magma algebra system. I: The user language
- An exact real algebraic arithmetic with equality determination
- Infinite power series
- Computing with Formal Power Series
- Rational Exponential Expressions and a Conjecture Concerning π and e
- Explicit Galois realization of transitive groups of degree up to 15
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equality in computer algebra and beyond.