POLY: A New Polynomial Data Structure for Maple 17

DOI10.1007/978-3-662-43799-5_24zbMath1352.68300OpenAlexW2809361502MaRDI QIDQ2799569

Roman Pearce, Michael B. Monagan

Publication date: 12 April 2016

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43799-5_24

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Data structures (68P05)

Related Items (4)

The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects ⋮ The complexity of sparse Hensel lifting and sparse polynomial factorization ⋮ POLY ⋮ Using Sparse Interpolation in Hensel Lifting

Uses Software

• gmp
• Macaulay2
• Magma
• Maple
• Maxima
• SageMath
• SINGULAR
• ALTRAN
• TRIP

Cites Work

• Sparse polynomial division using a heap
• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

This page was built for publication: POLY: A New Polynomial Data Structure for Maple 17