Pages that link to "Item:Q294768"
From MaRDI portal
The following pages link to A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768):
Displaying 5 items.
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
