Conference
The Sparsity Challenges
Abstract
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. This is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose.
Authors
Davenport JH; Carette J
Pagination
pp. 3-7
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
September 1, 2009
DOI
10.1109/synasc.2009.62
Name of conference
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing