Two New Techniques for Computing Extremal h-bases Ak

DOI10.1093/COMJNL/36.2.117zbMATH Open0774.11008DBLPjournals/cj/Challis93OpenAlexW2017959893WikidataQ29031458 ScholiaQ29031458MaRDI QIDQ5285451FDOQ5285451

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

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$

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The postage stamp problem: The extremal basis for \(k=4\)
• Planar additive bases for rectangles
• Title not available (Why is that?)
• On extremal $h$-bases $A_4$.
• On Rödseth's $h$-bases $A_k=\{1,a_2,2a_2,\dots,(k-2)a_2,a_k\}$.
• A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
• Extremal bases for finite cyclic groups
• On the order of subsets of asymptotic bases
• Title not available (Why is that?)
• 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: 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)