Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications

DOI10.1007/978-3-540-73437-6_20MaRDI QIDQ3506921zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Oren Kapah, Ely Porat

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_20

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3994906
• A deterministic sparse FFT algorithm for vectors with small support
• The sparse cardinal sine decomposition and its application for fast numerical convolution
• Time-space efficient algorithms for computing convolutions and related problems
• scientific article; zbMATH DE number 179269

Cited in

(1)

• Fast n-fold Boolean convolution via additive combinatorics

This page was built for publication: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications

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