Abstract
The problem of recognizing decomposability of partially defined Boolean functions is considered. The results include polynomial time algorithms for certain important types of decomposition, as well as NP-completeness proofs for more complex structures.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 51-75 |
| Number of pages | 25 |
| Journal | Discrete Applied Mathematics |
| Volume | 62 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Sep 8 1995 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Decomposability of partially defined Boolean functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver