The complexity of AND-decomposition of Boolean functions (Q2181249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of AND-decomposition of Boolean functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of AND-decomposition of Boolean functions |
scientific article |
Statements
The complexity of AND-decomposition of Boolean functions (English)
0 references
18 May 2020
0 references
conjunctive decomposition
0 references
disjoint decomposition
0 references
polynomial factorization
0 references
computational complexity
0 references
0 references
0 references
0 references
