Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838): 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.1007/978-3-319-55911-7_29 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2598290983 / rank | |||
Normal rank | |||
Revision as of 01:44, 20 March 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
