Computing generalized convolutions faster than brute force

DOI10.4230/LIPICS.IPEC.2022.12MaRDI QIDQ6969000zbMATH OpenFDO

Authors Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

generalized convolutionfast Fourier transformfast subset convolution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Computing generalized convolutions faster than brute force

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969000)