Corpus ID: 198897992

The Strong 3SUM-INDEXING Conjecture is False

@article{Kopelowitz2019TheS3,
  title={The Strong 3SUM-INDEXING Conjecture is False},
  author={Tsvi Kopelowitz and E. Porat},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.11206}
}
  • Tsvi Kopelowitz, E. Porat
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from $U$, $A=(a_1,a_2,\ldots,a_n)$ and $B=(b_1,b_2,...,b_n)$, such that given an element $c\in U$ one can quickly determine whether there exists a pair $(a,b)\in A \times B$ where $a+b=c$. Goldstein et al.~[WADS'2017] conjectured that there is no algorithm for 3SUM-Indexing which uses $n^{2-\Omega(1)}$ space and $n^{1-\Omega(1)}$ query time. We show that the conjecture is false by reducing the 3SUM-Indexing problem to… CONTINUE READING
    5 Citations

    Topics from this paper

    Tight Quantum Time-Space Tradeoffs for Function Inversion
    • 1
    • PDF
    All non-trivial variants of 3-LDT are equivalent
    • 2
    • PDF
    Data structures meet cryptography: 3SUM with preprocessing
    • 1
    • PDF
    The Function-Inversion Problem: Barriers and Opportunities
    • 8
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Finding, Minimizing, and Counting Weighted Subgraphs
    • 69
    • PDF
    Dynamic Set Intersection
    • 18
    • PDF
    On Hardness of Jumbled Indexing
    • 71
    • PDF
    Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
    • 31
    • PDF
    Consequences of Faster Alignment of Sequences
    • 122
    • PDF
    Higher Lower Bounds from the 3SUM Conjecture
    • 94
    • PDF
    Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
    • A. Abboud, V. Williams
    • Mathematics, Computer Science
    • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
    • 2014
    • 275
    • PDF
    On a class of O(n2) problems in computational geometry
    • 263
    • PDF
    Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
    • 15
    • PDF
    How Hard is it to Find (Honest) Witnesses?
    • 17
    • PDF