New Enumeration Algorithm for Regular Boolean Functions

21 Pages Posted: 25 Jan 2016

See all articles by Walid F Nasrallah

Walid F Nasrallah

World Bank

F. Jordan Srour

Lebanese American University - Department of Information Technology and Operations Management

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

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

Walid F Nasrallah

World Bank ( email )

1818 H Street, NW
Washington, DC 20433
United States

Faith Jordan Srour (Contact Author)

Lebanese American University - Department of Information Technology and Operations Management ( email )

Shannon Hall, 3106
Chouran Beirut, 1102 2801
Lebanon

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
16
Abstract Views
379
PlumX Metrics