The Linear Complexity of Computation
From MaRDI portal
Publication:4085240
Cited in
(5)- A note on the use of determinant for proving lower bounds on the size of linear circuits
- Quick-means: accelerating inference for K-means by learning fast transforms
- Matrix rigidity
- Min-rank conjecture for log-depth circuits
- Entropy of operators or why matrix multiplication is hard for depth-two circuits
This page was built for publication: The Linear Complexity of Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085240)