All-Integers 3SUM: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of integers in each set | $n$: number of integers in each set | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 08:28, 10 April 2023
Description
Given three lists $A, B, C$ of $n$ integers each, output the list of all integers $a \in A$ such that there exist $b \in B,c \in C$ with $a + b + c = 0$.
Related Problems
Generalizations: 3SUM
Parameters
$n$: number of integers in each set
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions TO Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| 3SUM | if: to-time: $O(n^{2-\epsilon})$ for some $\epsilon > {0}$ then: from-time: $O(n^{1.5} + n^{2-\epsilon / 2})$ |
2018 | https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 8.1 | link |
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| 3SUM | if: to-time: $T(n)$ then: from-time: $O(T(n))$ |
link |