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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
010203019772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has… (More)
Is this relevant?
2008
2008
Abstract. The subset sum problem over finite fields is a well-known NPcomplete problem. It arises naturally from decoding… (More)
Is this relevant?
2007
2007
We propose an optical computational device which uses light rays for solving the subset-sum problem. The device has a graph-like… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
In the multiple subset sum problem (MSSP) items from a given ground set are selected and packed into a given number of identical… (More)
Is this relevant?
2000
2000
In this paper we study the subset-sum problem (SSP), which is the problem of ®nding, given a set of n positive integers and a… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1998
1998
In the well-known Subset Sum Problem, we are given positive integers a,, , a, and t and are to determine if some subset of the ai… (More)
Is this relevant?
1997
1997
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias… (More)
  • table 1
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The subset sum problem is to decide whether or not the 0-l integer programming problem <italic>&Sgr;<supscrpt>n</supscrpt… (More)
  • table I
Is this relevant?