An Efficient Method for Generating Optimal OBDD of Boolean Functions
- Ashutosh Singh
- Anand Mohan
Abstract
An efficient method of finding optimal (OBDD) of an n variable Boolean function is presented that offers a simple and straightforward procedure for optimal OBDD generation along with storage economy. This is achieved by generating n! fold tables and applying node reduction rules to each fold table directly instead of generating all n! OBDDs of the function.
- Full Text:
PDF
- DOI:10.5539/cis.v1n2p56
Journal Metrics
WJCI (2020): 0.439
Impact Factor 2020 (by WJCI): 0.247
Google Scholar Citations (March 2022): 6907
Google-based Impact Factor (2021): 0.68
h-index (December 2021): 37
i10-index (December 2021): 172
(Click Here to Learn More)
Index
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- CiteFactor
- CNKI Scholar
- COPAC
- CrossRef
- DBLP (2008-2019)
- EBSCOhost
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- Google Scholar
- Harvard Library
- Infotrieve
- LOCKSS
- Mendeley
- PKP Open Archives Harvester
- Publons
- ResearchGate
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- The Index of Information Systems Journals
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WJCI Report
- WorldCat
Contact
- Chris LeeEditorial Assistant
- cis@ccsenet.org