An n3/2 lower bound on the monotone network complexity of the Boolean convolution (Q3698705): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:42, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An n3/2 lower bound on the monotone network complexity of the Boolean convolution |
scientific article |
Statements
An n3/2 lower bound on the monotone network complexity of the Boolean convolution (English)
0 references
1983
0 references
semidisjoint bilinear forms
0 references
