An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118): 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/0304-3975(85)90030-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089119058 / rank | |||
Normal rank | |||
Revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution |
scientific article |
Statements
An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (English)
0 references
1985
0 references
The main result establishes an \(\Omega (n^{4/3})\) lower bound on the number of \(\wedge\)-gates in any monotone network computing Boolean convolution of two Boolean n-vectors. The proof is based on a normal form of monotone networks introduced by the author.
0 references
Boolean function
0 references
and-gate
0 references
Boolean vector
0 references
Boolean convolution
0 references
normal form
0 references
