The sparsity challenges

James H Davenport; Jacques Carette

doi:10.1109/SYNASC.2009.62

The sparsity challenges

McMaster University

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

6 Citations (SciVal)

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 language	English
Title of host publication	2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)
Publisher	IEEE
Pages	3-7
Number of pages	5
ISBN (Electronic)	9781424459117
ISBN (Print)	9781424459100
DOIs	https://doi.org/10.1109/SYNASC.2009.62
Publication status	Published - 2009
Event	11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing: SYNASC 2009 - Timisoara, Romania Duration: 26 Sept 2009 → 29 Sept 2009

Conference

Conference	11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Country/Territory	Romania
City	Timisoara
Period	26/09/09 → 29/09/09

Access to Document

10.1109/SYNASC.2009.62

Cite this

@inproceedings{722a97d9aa4f4014b82e7d6bb795cdc8,

title = "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",

author = "Davenport, {James H} and Jacques Carette",

year = "2009",

doi = "10.1109/SYNASC.2009.62",

language = "English",

isbn = "9781424459100",

pages = "3--7",

booktitle = "2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)",

publisher = "IEEE",

address = "USA United States",

note = "11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing : SYNASC 2009 ; Conference date: 26-09-2009 Through 29-09-2009",

}

TY - GEN

T1 - The sparsity challenges

AU - Davenport, James H

AU - Carette, Jacques

PY - 2009

Y1 - 2009

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=77953046992&partnerID=8YFLogxK

UR - http://synasc09.info.uvt.ro/

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

U2 - 10.1109/SYNASC.2009.62

DO - 10.1109/SYNASC.2009.62

M3 - Chapter in a published conference proceeding

SN - 9781424459100

SP - 3

EP - 7

BT - 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)

PB - IEEE

T2 - 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Y2 - 26 September 2009 through 29 September 2009

ER -

The sparsity challenges

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this