Geodesic
A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
Journal of integer sequences, Tome 17 (2014) no. 6
An additive 2-basis with range $n$ is $restricted$ if its largest element is $n/2$. Among the restricted 2-bases of given length $k$, the ones that have the greatest range are extremal restricted. We describe an algorithm that finds the extremal restricted 2-bases of a given length, and we list them for lengths up to $k = 41$.
Classification : 11B13
Keywords: additive basis, restricted basis 
@article{JIS_2014__17_6_a3,
     author = {Kohonen,  Jukka},
     title = {A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases},
     journal = {Journal of integer sequences},
     year = {2014},
     volume = {17},
     number = {6},
     zbl = {1317.11018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JIS_2014__17_6_a3/}
}
TY  - JOUR
AU  - Kohonen,  Jukka
TI  - A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
JO  - Journal of integer sequences
PY  - 2014
VL  - 17
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/JIS_2014__17_6_a3/
LA  - en
ID  - JIS_2014__17_6_a3
ER  - 
%0 Journal Article
%A Kohonen,  Jukka
%T A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
%J Journal of integer sequences
%D 2014
%V 17
%N 6
%U http://geodesic.mathdoc.fr/item/JIS_2014__17_6_a3/
%G en
%F JIS_2014__17_6_a3
Kohonen,  Jukka. A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases. Journal of integer sequences, Tome 17 (2014) no. 6. http://geodesic.mathdoc.fr/item/JIS_2014__17_6_a3/