Two New Techniques for Computing Extremal h-bases Ak
From MaRDI portal
Publication:5285451
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
(12)- scientific article; zbMATH DE number 2149828 (Why is no real title available?)
- Planar additive bases for rectangles
- scientific article; zbMATH DE number 493642 (Why is no real title available?)
- On Rödseth's $h$-bases $A_k=\{1,a_2,2a_2,\dots,(k-2)a_2,a_k\}$.
- Extremal bases for finite cyclic groups
- A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
- On the order of subsets of asymptotic 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$
- scientific article; zbMATH DE number 493640 (Why is no real title available?)
- On extremal $h$-bases $A_4$.
- scientific article; zbMATH DE number 1908107 (Why is no real title available?)
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)