The sparsity challenges

James H Davenport, Jacques Carette

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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
Original languageEnglish
Title of host publication2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)
PublisherIEEE
Pages3-7
Number of pages5
ISBN (Electronic)9781424459117
ISBN (Print)9781424459100
DOIs
Publication statusPublished - 2009
Event11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing: SYNASC 2009 - Timisoara, Romania
Duration: 26 Sep 200929 Sep 2009

Conference

Conference11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
CountryRomania
CityTimisoara
Period26/09/0929/09/09

Fingerprint Dive into the research topics of 'The sparsity challenges'. Together they form a unique fingerprint.

  • Cite this

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