Probably faster multiplication of sparse polynomials
HomepagePublicationsTalksTeXmacsMathemagix

Abstract

In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that will be made precise.

Author: Joris van der Hoeven

View: Html, TeXmacs, Pdf, BibTeX