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

Authors

512

  1. UP
    Ulrich Pferschy

    University of Graz, Austria

    6 publications · 310 citations

    6

    h-index

  2. AS
    Andràs Sárközy

    Eötvös Loránd University, Hungary

    6 publications · 154 citations

    6

    h-index

  3. PE
    P. Erdös

    Hungarian Academy of Sciences, Hungary

    6 publications · 806 citations

    6

    h-index

  4. ES
    Endre Szemerédi

    Hungarian Academy of Sciences, Hungary

    4 publications · 139 citations

    4

    h-index

  5. KB
    Karl Bringmann

    Max Planck Institute for Informatics, Germany

    4 publications · 116 citations

    4

    h-index

1–5 of 512

Venues

  1. Journal of Number Theory

    14 publications · 383 citations

    12

    h-index

  2. Acta Arithmetica

    12 publications · 348 citations

    11

    h-index

  3. Discrete Mathematics

    12 publications · 620 citations

    11

    h-index

  4. COMBINATORICA

    8 publications · 520 citations

    8

    h-index

  5. Combinatorics Probability Computing

    6 publications · 145 citations

    6

    h-index

1–5