Sparse nonnegative convolution is equivalent to dense nonnegative convolution

@article{Bringmann2021SparseNC,
  title={Sparse nonnegative convolution is equivalent to dense nonnegative convolution},
  author={Karl Bringmann and Nick Fischer and Vasileios Nakos},
  journal={Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2021}
}
Computing the convolution A ⋆ B of two length-n vectors A,B is an ubiquitous computational primitive, with applications in a variety of disciplines. Within theoretical computer science, applications range from string problems to Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These applications often come in the form of nonnegative convolution, where the entries of A,B are nonnegative integers. The classical algorithm to compute A⋆ B uses the Fast Fourier Transform (FFT) and… 

Fast n-fold Boolean Convolution via Additive Combinatorics

A deterministic or randomized o(nk) algorithm running in almost linear time with respect to the input plus output size k is presented, and a new deterministic almost linear output-sensitive algorithm for non-negative sparse convolution is presented.

Removing Additive Structure in 3SUM-Based Reductions

It is shown that solving 3SUM on a size-n integer set that avoids solutions to a + b = c + d for {a, b} 6 = {c, d} still requires n time, under the3SUM hypothesis, which implies that the All-Edges Sparse Triangle problem on nvertex graphs with maximum degree √ n and at mostn k-cycles for every k ≥ 3 requiresn time.

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics

The “short cycle removal” technique was recently introduced by Abboud, Bringmann, Khoury and Zamir to prove fine-grained hardness of approximation and is settled by showing that the Õ(min(m, n)+ t) upper bound is tight up to n factors.

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

This paper presents the first deterministic near-linear-time algorithm for computing sparse nonnegative convolutions, which immediately gives improved deterministic algorithms for the state-of-the-art of output-sensitive Subset Sum, block-mass pattern matching, N -fold Boolean convolution, and others, matching up to log-factors the fastest known randomized algorithms for these problems.

References

SHOWING 1-10 OF 65 REFERENCES

On the bit-complexity of sparse polynomial and series multiplication

Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average

  • M. Kapralov
  • Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
This paper proposes a new technique for analysing noisy hashing schemes that arise in Sparse FFT, which it refers to as isolation on average, and applies this technique to two problems in Sparser FFT: estimating the values of a list of frequencies using few samples and computing SparseFFT itself, achieving sample-optimal results in k\log^{O(1)} n time for both.

Nearly optimal sparse fourier transform

If one assumes that the Fast Fourier Transform is optimal, the algorithm for the exactly k-sparse case is optimal for any k = nΩ(1), and the first known algorithms that satisfy this property are shown.

Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for

Dimension-independent Sparse Fourier Transform

The first algorithm that computes the DFT of a $k-sparse signal in time $\text{poly}(k, \log N)$ in any dimension $d$ is given, avoiding the curse of dimensionality inherent in all previously known techniques.

Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic

A new interpolation algorithm for a sparse multivariate polynomial represented by a straight-line program (SLP) that is a Monte Carlo randomized algorithm and works over fields with large or zero characteristic.

Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time

This work considers the problem of computing a k-sparse approximation to the Fourier transform of a length N signal and proposes a randomized algorithm for computing such an approximation using Od(klogNloglogN) samples of the signal in time domain and Od( klogd+3 N) runtime.

A Robust Sparse Fourier Transform in the Continuous Setting

  • Eric PriceZhao Song
  • Computer Science
    2015 IEEE 56th Annual Symposium on Foundations of Computer Science
  • 2015
An algorithm for robustly computing sparse Fourier transforms in the continuous setting and new results for how precisely the individual frequencies of x* can be recovered are given.

Improved time bounds for near-optimal sparse Fourier representations

A significantly improved algorithm for the problem of finding a Fourier representation R of m terms for a given discrete signal A of length N and a quadratic-in-m algorithm that works for any values of Ni's is given.

Reducing 3SUM to Convolution-3SUM

A simple deterministic reduction from 3SUM to Convolution-3SUM for integers bounded by U is presented and additional ideas to obtaining further improved reductions are described, with only a (log logn) factor slowdown in the randomized case, and a log U factor slowdownIn the deterministic case.
...