Subset sum problem

Known as: Subset Sum, Subset-sum, Sum of subsets

In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set (or…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Capacity Related Reliability (CRR) is an important performance index for flow networks. Most of the CRR evaluation techniques…

2014

This brief presents several enhancement modules to Multipath Transmission Control Protocol (MPTCP) in order to support stable and…

2008

Starting with a set of weighted items, we want to create a gene ric sample of a certain size that we can later use to estimate…

2005

Let $c>\sqrt{2}$ and let $p$ be a prime number. J-M. Deshouillers and G. A. Freiman proved that a subset $\mathcal A$ of $\mathbb…

2005

Let n be a large number. A subset A of Zn is complete if S A = Zn, where S A is the collection of the subset sums of A. Olson…

2004

A permutation $\pi$ of an abelian group $G$ (that is, a bijection from $G$ to itself) will be said to avoid arithmetic…

2000

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what…

2000

Suppose a 1 < a 2 < : : : < a Z are distinct integers in f1; : : :; N g. If a 0 +" 1 a 1 +" 2 a 2 + + " Z a Z is prime for all…

1996

We investigate the evolutionary heuristics used as approximation algorithm to the subset sum problem. We propose a graded penalty…

1987

SummaryThis paper presents parallel approximation schemes for the Subset Sum, 0–1 Knapsack, and several other optimization…