A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
J. Integer Seq. 17(6), Article 14.6.8, 11 p., electronic only (2014)
Summary
Summary: 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$.
