Pages that link to "Item:Q4706215"
From MaRDI portal
The following pages link to Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates (Q4706215):
Displaying 11 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)
- Lower bounds for matrix factorization (Q2041242) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← 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)
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
