Fast n-Fold Boolean Convolution via Additive Combinatorics

Bringmann, Karl; Nakos, Vasileios

doi:10.4230/LIPIcs.ICALP.2021.41

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fast n-Fold Boolean Convolution via Additive Combinatorics

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons251391

Nakos, Vasileios
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2021/14110/pdf/LIPIcs-ICALP-2021-41.pdf
(Publisher version)

https://creativecommons.org/licenses/by/4.0/legalcode
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., & Nakos, V. (2021). Fast n-Fold Boolean Convolution via Additive Combinatorics. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2021.41.

Cite as: https://hdl.handle.net/21.11116/0000-0008-DB8E-2

Abstract

There is no abstract available