Sparse polynomial division using a heap

DOI10.1016/j.jsc.2010.08.014zbMath1291.68435OpenAlexW2113737071MaRDI QIDQ540332

Roman Pearce, Michael B. Monagan

Publication date: 1 June 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.08.014

zbMATH Keywords

heapspolynomial multiplicationsparse polynomialspolynomial data structurespolynomial division

Mathematics Subject Classification ID

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

Related Items (8)

Fundamental invariants for the action of $SL_3(\mathbb {C}) \times SL_3(\mathbb {C}) \times SL_3(\mathbb {C})$ on $3 \times 3 \times 3$ arrays ⋮ Chordal Networks of Polynomial Ideals ⋮ Computation of involutive and Gröbner bases using the tableau representation of polynomials ⋮ POLY: A New Polynomial Data Structure for Maple 17 ⋮ Giac and GeoGebra – Improved Gröbner Basis Computations ⋮ Lazy and Forgetful Polynomial Arithmetic and Applications ⋮ Polynomial modular product verification and its implications ⋮ Fermat benchmarks for rational expressionals in maple

Uses Software

• gmp
• Magma
• Maple
• PARI/GP
• SINGULAR
• ALTRAN
• TRIP

Cites Work

• Unnamed Item
• The geobucket data structure for polynomials
• The Magma algebra system. I: The user language
• Parallel sparse polynomial multiplication using heaps
• Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
• Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
• Sorting X + Y
• A Sorting Algorithm for Polynomial Multiplication
• Comparing the speed of programs for sparse polynomial multiplication

This page was built for publication: Sparse polynomial division using a heap