The “short cycle removal” technique was recently introduced by Abboud, Bringmann, Khoury
and Zamir (STOC'22) to prove fine-grained hardness of approximation. Its main technical …

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 …

We revisit the classic 0-1-Knapsack problem, in which we are given $ n $ items with their
weights and profits as well as a weight budget $ W $, and the goal is to find a subset of items …

We study the classic Text-to-Pattern Hamming Distances problem: given a pattern P of
length m and a text T of length n, both over a polynomial-size alphabet, compute the …

What is the time complexity of matrix multiplication of sparse integer matrices with m in
nonzeros in the input and m out nonzeros in the output? This paper provides improved …

In this paper we carefully combine Fredman's trick [SICOMP'76] and Matoušek's approach
for dominance product [IPL'91] to obtain powerful results in fine-grained complexity. Under …

In sparse convolution-type problems, a common technique is to hash the input integers
modulo a random prime p∈[Q/2, Q] for some parameter Q, which reduces the range of the …

We propose an O (n+ 1/)-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the
classical Partition problem. This is the best possible (up to a polylogarithmic factor) …

How fast can you test whether a constellation of stars appears in the night sky? This
question can be modeled as the computational problem of testing whether a set of points P …

We investigate pseudo-polynomial time algorithms for Subset Sum. Given a multi-set $ X $
of $ n $ positive integers and a target $ t $, Subset Sum asks whether some subset of $ X …