Sparse polynomial division using a heap
type: Item
instance of: scholarly article
title: Sparse polynomial division using a heap
zbMATH Open document ID: 1291.68435
author: Roman Pearce
author: Michael Monagan
published in: Journal of Symbolic Computation
publication date: 2011-06-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5903426
zbMATH Keywords: sparse polynomials
zbMATH Keywords: polynomial multiplication
zbMATH Keywords: polynomial division
zbMATH Keywords: polynomial data structures
zbMATH Keywords: heaps
describes a project that uses: gmp
describes a project that uses: ALTRAN
describes a project that uses: SINGULAR
describes a project that uses: Magma
describes a project that uses: Maple
describes a project that uses: PARI/GP
describes a project that uses: TRIP
MaRDI profile type: Publication
full work available at URL: j.jsc.2010.08.014
OpenAlex ID: W2113737071
cites work: Q4232515
cites work: The Magma algebra system. I: The user language
cites work: Comparing the speed of programs for sparse polynomial multiplication
cites work: Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
cites work: Sorting X + Y
cites work: A Sorting Algorithm for Polynomial Multiplication
cites work: Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
cites work: Parallel sparse polynomial multiplication using heaps
cites work: The geobucket data structure for polynomials
DOI: 10.1016/J.JSC.2010.08.014
description: scientific article; zbMATH DE number 5903426