An n3/2 lower bound on the monotone network complexity of the Boolean convolution (Q3698705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An n3/2 lower bound on the monotone network complexity of the Boolean convolution |
scientific article; zbMATH DE number 3922540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An n3/2 lower bound on the monotone network complexity of the Boolean convolution |
scientific article; zbMATH DE number 3922540 |
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
0.9313582181930542
0 references
0.8986102938652039
0 references
0.8073959946632385
0 references
