An enumeration algorithm for all integers nonrepresentable by some positive integers
We propose an enumeration algorithm for integers nonrepresentable by given integers. We analyze the computational complexities of the proposed algorithm. The proposed enumeration algorithm is an amortized polynomial-time delay algorithm. The proposed enumeration algorithm is not a polynomial-space algorithm. The dimension in any enumeration is assumed constant.
enumeration algorithm amortized polynomial-time delay analysis of algorithms frobenius number amortized analysis