Two New Techniques for Computing Extremal h-bases Ak

DOI10.1093/COMJNL/36.2.117MaRDI QIDQ5285451zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

algorithmscomputational methodsextremal \(h\)-basesextremale \(h\)-Reichweitepostage stamp problemtables

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)

Recommendations

• scientific article; zbMATH DE number 493642
• Extremal bases for finite cyclic groups
• The minimal range of additive h-bases.
• scientific article; zbMATH DE number 1908107
• The Postage Stamp Problem: An algorithm to determine the h-range on the h-range formula on the extremal basis problem for k=4

Cited in

(13)

• Extremal bases for finite cyclic groups
• A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
• Extremale asymptotische Reichweitenbasen
• On extremal h-bases A₄.
• On Rödseth's $h$-bases $A_k=\{1,a_2,2a_2,\dots,(k-2)a_2,a_k\}$.
• scientific article; zbMATH DE number 493640 (Why is no real title available?)
• scientific article; zbMATH DE number 493642 (Why is no real title available?)
• Planar additive bases for rectangles
• scientific article; zbMATH DE number 2149828 (Why is no real title available?)
• The Postage Stamp Problem: An algorithm to determine the h-range on the h-range formula on the extremal basis problem for k=4
• scientific article; zbMATH DE number 1908107 (Why is no real title available?)
• The postage stamp problem: The extremal basis for k=4
• On the order of subsets of asymptotic bases

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285451)