The complexity of modular decomposition of Boolean functions (Q2387426): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.12.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135652786 / rank | |||
Normal rank | |||
Revision as of 00:55, 20 March 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
