Sumsets, 3SUM, Subset Sum: Now for Real!
Nick Fischer

TL;DR
This paper introduces a novel technique for computing sumsets over real numbers, enabling the adaptation of several landmark integer algorithms to real inputs with comparable efficiency, thus bridging the gap between integer and real input problem-solving.
Contribution
The authors develop a new algebraic-combinatorial method for real sumsets, extending efficient algorithms for sumsets, geometric pattern matching, 3SUM, and Subset Sum to real inputs.
Findings
Real sumset computation time matches integer algorithms.
Efficient algorithms for geometric pattern matching over reals.
Preprocessing and output-sensitive algorithms for 3SUM and Subset Sum over reals.
Abstract
We study a broad class of algorithmic problems with an "additive flavor" such as computing sumsets, 3SUM, Subset Sum and geometric pattern matching. Our starting point is that these problems can often be solved efficiently for integers, owed to the rich available tool set including bit-tricks, linear hashing, and the Fast Fourier Transform. However, for real numbers these tools are not available, leading to significant gaps in the best-known running times for integer inputs versus for real inputs. In this work our goal is to close this gap. As our key contribution we design a new technique for computing real sumsets. It is based on a surprising blend of algebraic ideas (like Prony's method and coprime factorizations) with combinatorial tricks. We then apply our new algorithm to the aforementioned problems and successfully obtain, in all cases, equally fast algorithms for real inputs.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization
