Algorithms for Computing the h-Range of the Postage Stamp Problem

DOI10.2307/2007661zbMath0481.10053OpenAlexW4232081314MaRDI QIDQ3937495

Svein Mossige

Publication date: 1981

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007661

zbMATH Keywords

extremal basispostage stamp problemReichweiteadmissible basisalgorithms for computing the h-rangelower bound for extremal 2-range

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Additive bases, including sumsets (11B13) Additive number theory; partitions (11P99)

Related Items (3)

An improved lower bound for finite additive 2-bases ⋮ The postage stamp problem: The extremal basis for \(k=4\) ⋮ The Postage Stamp Problem: An algorithm to determine the $h$-range on the $h$-range formula on the extremal basis problem for $k=4$

This page was built for publication: Algorithms for Computing the h-Range of the Postage Stamp Problem