A 4n-lower bound on the monotone network complexity of a one-output Boolean function (Q800311): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 4n-lower bound on the monotone network complexity of a one-output Boolean function |
scientific article |
Statements
A 4n-lower bound on the monotone network complexity of a one-output Boolean function (English)
0 references
1984
0 references
In this paper a special Boolean function is defined and its lower bound of size 4n over the monotone basis is proved.
0 references
threshold-k-function
0 references
monotone network complexity
0 references
Boolean function
0 references
