Download This PaperNew Enumeration Algorithm for Regular Boolean Functions
21 Pages Posted: 25 Jan 2016
Date Written: January 24, 2016
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.
Keywords: Regular Boolean Functions, Binary Majorization Lattice
Suggested Citation: Suggested Citation
Nasrallah, Walid F and Srour, Faith Jordan, New Enumeration Algorithm for Regular Boolean Functions (January 24, 2016). Available at SSRN: https://ssrn.com/abstract=2683502 or http://dx.doi.org/10.2139/ssrn.2683502
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.
