New enumeration algorithm for regular boolean functions

LAUR Repository

Show simple item record

dc.contributor.author Srour, F. Jordan
dc.contributor.author Nasrallah, Walid F.
dc.date.accessioned 2018-01-09T13:25:36Z
dc.date.available 2018-01-09T13:25:36Z
dc.date.issued 2018-01-09
dc.identifier.uri http://hdl.handle.net/10725/6885 en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.title New enumeration algorithm for regular boolean functions en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SOB en_US
dc.author.idnumber 201204645 en_US
dc.author.department Department of Information Technology and Operations Management (ITOM) en_US
dc.description.embargo N/A en_US
dc.keywords Regular Boolean Functions en_US
dc.keywords Binary Majorization Lattice en_US
dc.identifier.doi http://dx.doi.org/10.2139/ssrn.2683502 en_US
dc.identifier.ctation Nasrallah, W. F., & Srour, F. J. (2016). New Enumeration Algorithm for Regular Boolean Functions. en_US
dc.author.email jordan.srour@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2683502 en_US
dc.orcid.id https://orcid.org/0000-0001-7623-723X en_US
dc.publication.date 2016 en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account