Paper detail

Early Pruning in the Restricted Postage Stamp Problem

A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted. Restricted bases have important special properties that facilitate efficient searching. With the help of these properties, we have previously listed the extremal restricted bases up to length $k = 41$. Here, with a more prudent use of the properties, we present an improved search algorithm and list all extremal restricted bases up to $k = 47$.