What Can (and Can't) we Do with Sparse Polynomials?
Abstract
Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact storage comes new algorithmic challenges, as fast algorithms for dense polynomials may no longer be efficient. In this tutorial we examine the state of the art for sparse polynomial algorithms in three areas: arithmetic, interpolation, and factorization. The aim is to highlight recent progress both in theory and in practice, as well as opportunities for future work.
Cite
@article{arxiv.1807.08289,
title = {What Can (and Can't) we Do with Sparse Polynomials?},
author = {Daniel S. Roche},
journal= {arXiv preprint arXiv:1807.08289},
year = {2018}
}
Comments
Tutorial at ISSAC 2018, Pages 25-30 of proceedings, In Proc. 43rd International Symposium on Symbolic and Algebraic Computation, ISSAC '18. ACM, New York, NY, 2018