The Postage Stamp Problem: An algorithm to determine the $h$-range on the $h$-range formula on the extremal basis problem for $k=4$

DOI10.1090/S0025-5718-99-01204-1zbMath0935.11005MaRDI QIDQ4700200

Svein Mossige

Publication date: 1 November 1999

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

zbMATH Keywords

algorithm\(h\)-rangepostage stamp problem\(h\)-basisextremal \(h\)-basis

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Representation problems (11D85)

Related Items (3)

The IC-indices of complete multipartite graphs ⋮ The postage stamp problem: The extremal basis for \(k=4\) ⋮ IC-colorings and IC-indices of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Associate bases in the postage stamp problem
• Extremale asymptotische Reichweitenbasen
• An upper bound for the h-range of the postage stamp problem
• On extremal $h$-bases $A_4$.
• Algorithms for Computing the h-Range of the Postage Stamp Problem
• Some Extremal 2-Bases
• Two New Techniques for Computing Extremal h-bases Ak
• Asymptotische Abschätzungen für dreielementige Extremalbasen in natürlichen Zahlen.

This page was built for publication: The Postage Stamp Problem: An algorithm to determine the $h$-range on the $h$-range formula on the extremal basis problem for $k=4$