Sparse polynomial division using a heap
From MaRDI portal
Publication:540332
DOI10.1016/J.JSC.2010.08.014zbMATH Open1291.68435OpenAlexW2113737071MaRDI QIDQ540332FDOQ540332
Authors: Roman Pearce, Michael 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
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
- Parallel sparse polynomial multiplication using heaps
- The geobucket data structure for polynomials
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Sorting X + Y
- A Sorting Algorithm for Polynomial Multiplication
- Title not available (Why is that?)
- Comparing the speed of programs for sparse polynomial multiplication
Cited In (12)
- Polynomial modular product verification and its implications
- Computation of involutive and Gröbner bases using the tableau representation of polynomials
- Fermat benchmarks for rational expressionals in Maple
- Lazy and Forgetful Polynomial Arithmetic and Applications
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Design and implementation of multi-threaded algorithms in polynomial algebra
- On exact division and divisibility testing for sparse polynomials
- 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
- Giac and GeoGebra -- improved Gröbner basis computations
- POLY: a new polynomial data structure for Maple 17
- Sparse polynomial powering using heaps
- Chordal networks of polynomial ideals
Uses Software
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)
