DocumentCode
2315902
Title
The Sparsity Challenges
Author
Davenport, James H. ; Carette, Jacques
Author_Institution
Dept. of Comput. Sci., Univ. of Bath, Bath, UK
fYear
2009
fDate
26-29 Sept. 2009
Firstpage
3
Lastpage
7
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.
Keywords
computational complexity; polynomials; process algebra; sparse matrices; advanced algorithms complexity; computer algebra; cyclotomic polynomials; sparse polynomials; sparsity challenges; Algebra; Computer science; Helium; Polynomials; Scientific computing; Software algorithms; Polynomial factorization; cyclotomic polynomials; sparsity;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4244-5910-0
Electronic_ISBN
978-1-4244-5911-7
Type
conf
DOI
10.1109/SYNASC.2009.62
Filename
5460882
Link To Document