Given a set Z of n positive integers and a target value t, the SuBSETSuM problem asks
whether any subset of Z sums to t. A textbook pseudopolynomial time algorithm by Bellman …

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 …

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 …

The Subset Sum problem asks whether a given set of $ n $ positive integers contains a
subset of elements that sum up to a given target $ t $. It is an outstanding open question …

We present an O∗(20.5 n) time and O∗(20.249999 n) space randomized algorithm for
solving worst-case Subset Sum instances with n integers. This is the first improvement over …

Approximating SubsetSum is a classic and fundamental problem in computer science and
mathematical optimization. The state-of-the-art approximation scheme for SubsetSum …

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 …

Given a set of n input integers, the Equal Subset Sum problem asks us to find two distinct
subsets with the same sum. In this paper we present an algorithm that runs in time …

We present randomized algorithms that solve subset sum and knapsack instances with n
items in O^*(2^0.86n) time, where the O^*(⋅) notation suppresses factors polynomial in the …