A 4n-lower bound on the monotone network complexity of a one-output Boolean function (Q800311): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3716970 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90111-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084152790 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 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
