Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors

DOI10.1007/978-3-540-75187-8_23MaRDI QIDQ3508493zbMATH OpenOpenAlexFDO

Authors Roman Pearce, Michael Monagan

Publication date 1 July 2008

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75187-8_23

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Sparse polynomial division using a heap
• Sparse polynomial powering using heaps
• The geobucket data structure for polynomials
• Sparse polynomial multiplication and division in Maple 14
• Parallel sparse polynomial multiplication using heaps

Cited in

(8)

• The geobucket data structure for polynomials
• Sparse polynomial powering using heaps
• Lazy and Forgetful Polynomial Arithmetic and Applications
• Fermat benchmarks for rational expressionals in Maple
• Chunky and equal-spaced polynomial multiplication
• Sparse polynomial division using a heap
• On exact division and divisibility testing for sparse polynomials
• New bounds on quotient polynomials with applications to exact division and divisibility testing of sparse polynomials

Describes a project that uses

Uses Software

• AXIOM
• FGb
• Macaulay2
• Maple
• SINGULAR

This page was built for publication: Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508493)