Research

The sparsity challenges


Reference:

Davenport, J. H. and Carette, J., 2009. The sparsity challenges. In: 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009). IEEE Press, pp. 3-7.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1109/SYNASC.2009.62

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

Details

Item Type Book Sections
CreatorsDavenport, J. H.and Carette, J.
DOI10.1109/SYNASC.2009.62
DepartmentsFaculty of Science > Computer Science
RefereedNo
StatusPublished
ID Code17324
Additional Information11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, 26-29 September 2009. Timisoara, Romania

Export

Actions (login required)

View Item