Some algorithmic results for [2]-sumset covers
From MaRDI portal
Publication:458372
Recommendations
Cites work
- A note on the postage stamp problem
- A Postage Stamp Problem
- Additive combinatorics
- scientific article; zbMATH DE number 2186879 (Why is no real title available?)
- scientific article; zbMATH DE number 434877 (Why is no real title available?)
- scientific article; zbMATH DE number 1558153 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3111990 (Why is no real title available?)
- Minimum sum covers of small cyclic groups
- Nonnegative integral subset representations of integer sets
- On Finding Small 2-Generating Sets
- On optimal subset representations of integer sets
- On the complexity of variations of equal sum subsets
- On the representation of 1,2,..., n by sums
- Representing powers of numbers as subset sums of small sets
- Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
- The minimum substring cover problem
Cited in
(3)
This page was built for publication: Some algorithmic results for [2]-sumset covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458372)