Search Results - "output-sensitive algorithm"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    Cover Image

    Fast \(n\)-fold Boolean Convolution via Additive Combinatorics by Bringmann, Karl, Nakos, Vasileios

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 09.05.2021
    Published in arXiv.org (09.05.2021)
    “… of \(n\) subproblems subject to a modular constraint. This simultaneously generalises Modular Subset Sum and Boolean Convolution (Sumset Computation…”
    Get full text
    Paper
    Save to List
    Saved in:

Search Tools: