The following pages link to Superconcentrators of depth 2 (Q1162816):
Displaying 12 items.
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- On shifting networks (Q685361) (← links)
- A geometric construction of a superconcentrator of depth 2 (Q798331) (← 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)
- Meanders and their applications in lower bounds arguments (Q1115606) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Superconcentrators of depths 2 and 3; odd levels help (rarely) (Q1318476) (← links)
- Communication in bounded depth circuits (Q1330798) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
