Sparse Polynomial Powering Using Heaps

DOI10.1007/978-3-642-32973-9_20zbMath1373.68462OpenAlexW1851343703MaRDI QIDQ2915001

Roman Pearce, Michael B. Monagan

Publication date: 21 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32973-9_20

zbMATH Keywords

parallel algorithmspowersheapssparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Data structures (68P05)

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sparse Polynomial Powering Using Heaps