We modify an old algorithm for expanding powers of dense polynomials to make it work for sparse polynomials, by using a heap to sort monomials. It has better complexity and lower space requirements than other sparse powering algorithms for dense polynomials. We show how to parallelize the method, and compare its performance on a series of benchmark problems to other methods and the Magma, Maple and Singular computer algebra systems.
CITATION STYLE
Monagan, M., & Pearce, R. (2012). Sparse polynomial powering using heaps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7442 LNCS, pp. 236–247). Springer Verlag. https://doi.org/10.1007/978-3-642-32973-9_20
Mendeley helps you to discover research relevant for your work.