Sparse nonnegative convolution is equivalent to dense nonnegative convolution

DOI10.1145/3406325.3451090arXiv2105.05984OpenAlexW3169127456MaRDI QIDQ6065287

Nick Fischer, Vasileios Nakos, Karl Bringmann

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.05984

zbMATH Keywords

convolutionFFTsparsitylinear hashing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics ⋮ Removing additive structure in 3SUM-based reductions

This page was built for publication: Sparse nonnegative convolution is equivalent to dense nonnegative convolution