A comparative study of algorithms for sparse polynomial multiplication

Authors:
Dorothea A. Klip
Affiliations:
-
Venue:
ACM SIGSAM Bulletin
Year:
1978

Citing 4
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Sorting Algorithm for Polynomial Multiplication

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Sparse polynomial arithmetic

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two algorithms will be discussed:GEN-MULT for the sorting of general tableaux and dense to moderately unstructured (multivariate) polynomials. This algorithm is based on the general properties of a "tableau", which hold for the matrix of the exponents of the polynomial product.