Pages that link to "Item:Q4085240"
From MaRDI portal
The following pages link to The Linear Complexity of Computation (Q4085240):
Displayed 5 items.
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Matrix rigidity (Q1970501) (← links)
- Quick-means: accelerating inference for K-means by learning fast transforms (Q2051290) (← links)