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 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:22, 5 March 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
