Subset sums in ℕ2

DOI10.1017/S0963548300002145zbMath0868.11005MaRDI QIDQ2785372

Norbert Hegyvári

Publication date: 19 August 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

subset sumsinfinite arithmetic progression

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

Related Items (3)

Erdős-Birch type question in \(\mathbb{N}^r\) ⋮ On a communication complexity problem in combinatorial number theory ⋮ Some results on an encryption method using subset-sums of pseudo-recursive sequences

Cites Work

• Completeness properties of perturbed sequences
• On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence

This page was built for publication: Subset sums in ℕ²