As a result, the researchers obtained improved algorithms for the sparse convolution problem, where the goal is to multiply polynomials where the input & output polynomials have a small number of nonzero terms.

→ View original post on X — @mit_csail,