论文信息 - A comparative study of algorithms for sparse polynomial multiplication

A comparative study of algorithms for sparse polynomial multiplication

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.

Dorothea A. Klip

[1] Ellis Horowitz. A Sorting Algorithm for Polynomial Multiplication , 1975, JACM.

[2] Stephen C. Johnson,et al. Sparse polynomial arithmetic , 1974, SIGS.

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .