Subset Sum Problems
Subset Sum Problems is a fundamental problem in additive combinatorics that consists in determining whether a given finite set of integers contains a subset whose elements sum to a specified target value, distinguished from related problems by its focus on the combinatorial structure of subset-induced sums within abelian groups.
296
Publications
13.9K
Citations
512
Authors
300
Institutions
Publications per year
2017–2026
38
Variants
Subset Sum Problem
Parents
296
FA Dick de Bruijn, P. Erdös · 1948 · 406 citations
Solving low-density subset sum problems
Jeffrey C. Lagarias, Andrew Odlyzko · Journal of the ACM · 1985 · 406 citations · Full text
On the algebraic structure of combinatorial problems
Peter Jeavons · Theoretical Computer Science · 1998 · 364 citations
1–5 of 296
512
6
h-index
6
h-index
6
h-index
4
h-index
4
h-index
1–5 of 512
300

Hungarian Academy of Sciences
Budapest, Hungary
12 h-index
20 publications
900 citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
14 publications
420 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
12 publications
224 citations
University of Graz
Graz, Austria
7 h-index
11 publications
425 citations

University of Bologna
Bologna, Italy
7 h-index
8 publications
262 citations
University of California, Irvine
Irvine, United States
6 h-index
6 publications
177 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
9 publications
211 citations
University of California San Diego
San Diego, United States
5 h-index
8 publications
727 citations
1–8 of 300
14 publications · 383 citations
12
h-index
12 publications · 348 citations
11
h-index
12 publications · 620 citations
11
h-index
8 publications · 520 citations
8
h-index
6 publications · 145 citations
6
h-index
1–5