Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q293198 |
Changed an Item |
||
| Property / author | |||
| Property / author: Andrzej Lingas / rank | |||
Normal rank | |||
Revision as of 18:36, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution |
scientific article |
Statements
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (English)
0 references
19 May 2017
0 references
semi-disjoint bilinear form
0 references
Boolean vector convolution
0 references
monotone Boolean circuit complexity
0 references
