Pages that link to "Item:Q3583577"
From MaRDI portal
The following pages link to Lower bounds on the bounded coefficient complexity of bilinear maps (Q3583577):
Displaying 5 items.
- Binary determinantal complexity (Q286175) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
