Our work explores the hardness of 3SUM instances without certain additive structures, and
its applications. As our main technical result, we show that solving 3SUM on a size-n integer …

Subset Sumand k-SAT are two of the most extensively studied problems in computer
science, and conjectures about their hardness are among the cornerstones of fine-grained …

In the Subset Sum problem we are given a set of n positive integers X and a target t and are
asked whether some subset of X sums to t. Natural parameters for this problem that have …

The subject of this paper is the time complexity of approximating Knapsack, Subset Sum,
Partition, and some other related problems. The main result is an Õ (n+ 1/ε 5/3) time …

In the classical SubsetSum problem we are given a set X and a target t, and the task is to
decide whether there exists a subset of X which sums to t. A recent line of research has …

We consider the canonical Subset Sum problem: given a list of positive integers a 1,…, an
and a target integer t with t> ai for all i, determine if there is an S⊆[n] such that Σ i∊ S ai= t …

We propose two heuristic polynomial memory collision finding algorithms for the low
Hamming weight discrete logarithm problem in any abelian group G. The first one is a direct …

We consider low-space algorithms for the classic Element Distinctness problem: given an
array of n input integers with O (log n) bit-length, decide whether or not all elements are …

In the Equal-Subset-Sum problem, we are given a set $ S $ of $ n $ integers and the
problem is to decide if there exist two disjoint nonempty subsets $ A, B\subseteq S $, whose …

For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a
strong need for low-memory algorithms. We show that the combination of techniques from …