A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
Number Theory
2018-10-04 v1 Combinatorics
Abstract
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.
Cite
@article{arxiv.1403.5945,
title = {A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases},
author = {Jukka Kohonen},
journal= {arXiv preprint arXiv:1403.5945},
year = {2018}
}
Comments
11 pages