The Sparsity Challenges

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Sep 2009Publisher:IEEEJournal:2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Authors: James Harold Davenport; Jacques Carette;

doi: 10.1109/synasc.2009.62

The Sparsity Challenges

- Summary
- Metrics

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.

Related Organizations

McMaster University
Canada
University of Bath
United Kingdom

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average