Pages that link to "Item:Q2988838"
From MaRDI portal
The following pages link to Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838):
Displaying 4 items.
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
- Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)
