Two New Techniques for Computing Extremal h-bases Ak

DOI10.1093/COMJNL/36.2.117zbMath0774.11008DBLPjournals/cj/Challis93OpenAlexW2017959893WikidataQ29031458 ScholiaQ29031458MaRDI QIDQ5285451

Michael F. Challis

Publication date: 29 June 1993

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.2.117

zbMATH Keywords

tablesalgorithmscomputational methodspostage stamp problemextremal \(h\)-basesextremale \(h\)-Reichweite

Mathematics Subject Classification ID

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

Related Items (3)

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$ ⋮ Planar additive bases for rectangles

This page was built for publication: Two New Techniques for Computing Extremal h-bases Ak