Recommendations
Cites work
- scientific article; zbMATH DE number 1262464 (Why is no real title available?)
- A Sorting Algorithm for Polynomial Multiplication
- Comparing the speed of programs for sparse polynomial multiplication
- Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
- Parallel sparse polynomial multiplication using heaps
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Sorting X + Y
- The Magma algebra system. I: The user language
- The geobucket data structure for polynomials
Cited in
(12)- 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
- Lazy and Forgetful Polynomial Arithmetic and Applications
- Sparse polynomial powering using heaps
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- 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
- Polynomial modular product verification and its implications
- Fermat benchmarks for rational expressionals in Maple
- Giac and GeoGebra -- improved Gröbner basis computations
- Design and implementation of multi-threaded algorithms in polynomial algebra
- On exact division and divisibility testing for sparse polynomials
This page was built for publication: Sparse polynomial division using a heap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540332)
