New enumeration algorithm for regular boolean functions
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 intr...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/10725/6885 http://dx.doi.org/10.2139/ssrn.2683502 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2683502 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|