Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Nearly Optimal Sparse Polynomial Multiplication
Speaker:Vasileios Nakos
coming from:Harvard University
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 24 January 2019
Duration:30 Minutes
Building:E1 4
In the sparse multiplication problem, one is asked to multiply two sparse polynomials f and g of degree at most n in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their coefficients F and G, respectively. Cole and Hariharan (STOC 02) have given a nearly optimal algorithm when the coefficients are positive, and Arnold and Roche (ISSAC 15) devised an algorithm running in time proportional to the “structural sparsity” of the product, i.e. the set supp(F) + supp(G). The latter algorithm is particularly efficient when there not ”too many cancellations” of coefficients in the product. In this work we give a clean, nearly optimal algorithm for the sparse polynomial multiplication problem, resolving an open question posed by Roche (ISSAC 18). Our algorithm is not only more general, but strictly faster than previous attempts, and beats FFT whenever the size of the output is at most n/log log n.
Name(s):Karl Bringmann
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Karl Bringmann, 01/18/2019 09:17 PM
Last modified:
Uwe Brahm/MPII/DE, 01/24/2019 07:01 AM
  • Karl Bringmann, 01/20/2019 10:10 PM
  • Karl Bringmann, 01/18/2019 09:17 PM -- Created document.