The following pages link to On shifting networks (Q685361):
Displaying 7 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)
- Communication in bounded depth circuits (Q1330798) (← links)
- The complexity of depth-two information networks (Q2513042) (← links)
- On complexity of linear operators on the class of circuits of depth 2 (Q3184524) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
