The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
From MaRDI portal
Publication:5178930
DOI10.1145/2733693.2733720zbMath1322.68287OpenAlexW2049605943MaRDI QIDQ5178930
Roman Pearce, Michael B. Monagan
Publication date: 18 March 2015
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2733693.2733720
Related Items (3)
Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ POLY ⋮ An interpolation algorithm for computing Dixon resultants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Magma algebra system. I: The user language
- POLY: A New Polynomial Data Structure for Maple 17
- Parallel sparse polynomial multiplication using heaps
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- Comparing the speed of programs for sparse polynomial multiplication
- Sparse polynomial multiplication and division in Maple 14
This page was built for publication: The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects