Comparing the speed of programs for sparse polynomial multiplication
From MaRDI portal
Publication:4810194
DOI10.1145/844076.844080zbMath1054.65022OpenAlexW2154440075MaRDI QIDQ4810194
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/844076.844080
Symbolic computation and algebraic computation (68W30) Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20) Real polynomials: analytic properties, etc. (26C05)
Related Items (7)
Compact representation of polynomials for algorithms for computing Gröbner and involutive bases ⋮ INTEGRATION BY PARTS: AN INTRODUCTION ⋮ Good coupling for the multiscale patch scheme on systems with microscale heterogeneity ⋮ Chunky and equal-spaced polynomial multiplication ⋮ Sparse polynomial division using a heap ⋮ The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects ⋮ Evaluation of a Java Computer Algebra System
Uses Software
This page was built for publication: Comparing the speed of programs for sparse polynomial multiplication
