The equivalence of Horn and network complexity for Boolean functions (Q1160604): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00289267 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042029993 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence of Horn and network complexity for Boolean functions |
scientific article |
Statements
The equivalence of Horn and network complexity for Boolean functions (English)
0 references
1981
0 references
Horn complexity
0 references
complexity measure for logical functions
0 references
Horn formula
0 references
quasi-Horn formula
0 references
0 references
