The following pages link to (Q3412385):
Displayed 5 items.
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- The complexity of depth-two information networks (Q2513042) (← links)
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)