The complexity of modular decomposition of Boolean functions (Q2387426): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: HINT / rank | |||
Normal rank | |||
Revision as of 11:17, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of modular decomposition of Boolean functions |
scientific article |
Statements
The complexity of modular decomposition of Boolean functions (English)
0 references
2 September 2005
0 references
Boolean function
0 references
computational complexity
0 references
modular set
0 references
modular closure
0 references
generalized Shannon decomposition
0 references
