New enumeration algorithm for regular boolean functions

Abstract

This paper introduces a new algorithm for enumerating regular Boolean functions. This algorithm exploits the equivalence between regular Boolean functions and positive threshold functions that can be used to represent instances of the knapsack problem. After proving this equivalence, this paper introduces a novel data structure that may, with further tweaking, enable faster enumeration algorithms for both regular Boolean functions and all-capacities knapsack problem instances.