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)

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

2018

2018

- Andrey Nikolaev, Alexander Ushakov
- J. Symb. Comput.
- 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

- Jiyou Li, Daqing Wan
- Finite Fields and Their Applications
- 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

- Mihai Oltean, Oana Muntean
- Natural Computing
- 2007

We propose an optical computational device which uses light rays for solving the subset-sum problem. The device has a graph-like… (More)

Is this relevant?

2000

2000

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy
- SIAM Journal on Optimization
- 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

- Hans Kellerer, Renata Mansini, Maria Grazia Speranza
- European Journal of Operational Research
- 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)

Is this relevant?

1998

1998

- Jorge L. Ramírez Alfonsín
- Discrete Applied Mathematics
- 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

- Márk Jelasity
- ICGA
- 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)

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

- Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern
- computational complexity
- 1992

The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Jeffrey C. Lagarias, Andrew M. Odlyzko
- 24th Annual Symposium on Foundations of Computer…
- 1983

The subset sum problem is to decide whether or not the 0-l integer programming problem <italic>&Sgr;<supscrpt>n</supscrpt… (More)

Is this relevant?