All non-trivial variants of 3-LDT are equivalent

01/05/2020
by   Bartłomiej Dudek, et al.
0

The popular 3-SUM conjecture states that there is no strongly subquadratic time algorithm for checking if a given set of integers contains three distinct elements that sum up to zero. A closely related problem is to check if a given set of integers contains distinct x_1, x_2, x_3 such that x_1+x_2=2x_3. This can be reduced to 3-SUM in almost-linear time, but surprisingly a reverse reduction establishing 3-SUM hardness was not known. We provide such a reduction, thus resolving an open question of Erickson. In fact, we consider a more general problem called 3-LDT parameterized by integer parameters α_1, α_2, α_3 and t. In this problem, we need to check if a given set of integers contains distinct elements x_1, x_2, x_3 such that α_1 x_1+α_2 x_2 +α_3 x_3 = t. For some combinations of the parameters, every instance of this problem is a NO-instance or there exists a simple almost-linear time algorithm. We call such variants trivial. We prove that all non-trivial variants of 3-LDT are equivalent under subquadratic reductions. Our main technical contribution is an efficient deterministic procedure based on the famous Behrend's construction that partitions a given set of integers into few subsets that avoid a chosen linear equation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2021

Efficient reductions and algorithms for variants of Subset Sum

Given (a_1, …, a_n, t) ∈ℤ_≥ 0^n + 1, the Subset Sum problem (𝖲𝖲𝖴𝖬) is to...
research
07/24/2018

A Note on Clustering Aggregation

We consider the clustering aggregation problem in which we are given a s...
research
04/30/2018

A Subquadratic Algorithm for 3XOR

Given a set X of n binary words of equal length w, the 3XOR problem asks...
research
02/15/2018

A Faster FPTAS for #Knapsack

Given a set W = {w_1,..., w_n} of non-negative integer weights and an in...
research
04/04/2023

The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography

In the average-case k-SUM problem, given r integers chosen uniformly at ...
research
08/10/2018

Linear time algorithm to check the singularity of block graphs

A block graph is a graph in which every block is a complete graph. Let G...
research
09/09/2020

Deterministic Linear Time Constrained Triangulation using Simplified Earcut

Triangulation algorithms that conform to a set of non-intersecting input...

Please sign up or login with your details

Forgot password? Click here to reset