Structural approach to subset sum problems
From MaRDI portal
Publication:506621
DOI10.1007/s10208-016-9326-8zbMath1428.11024OpenAlexW2548462069MaRDI QIDQ506621
Publication date: 1 February 2017
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-016-9326-8
densitysumsetsarithmetic progressionsinverse theoremsmodularitycomplete and subcomplete sequencesgeneralized arithmetic progressions
Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Inverse problems of additive number theory, including sumsets (11P70)
Related Items (2)
The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some new results on subset sums
- On complete subsets of the cyclic group
- Finite addition theorems. I
- Generalized arithmetical progressions and sumsets
- Finite and infinite arithmetic progressions in sumsets
- On the representation of large integers as sums of distinct summands taken from a fixed set
- Asymptotically tight bounds on subset sums
- Integer Sum Sets Containing Long Arithmetic Progressions
- Sums of sets of group elements
- Cyclic Spaces for Grassmann Derivatives and Additive Theory
- On subset sums of a fixed set
- On the representation of integers as sums of distinct terms from a fixed set
- On the maximal density of sum-free sets
- Long arithmetic progressions in sum-sets and the number x-sum-free sets
- On the Addition of Residue Classes
- On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence
- On the addition of residue classes mod p
- An addition theorem modulo p
- Long arithmetic progressions in sumsets: Thresholds and bounds
- Arithmetic progressions in sumsets
- Arithmetic progressions in sumsets
This page was built for publication: Structural approach to subset sum problems
