Pages that link to "Item:Q4429689"
From MaRDI portal
The following pages link to On the Complexity of Matrix Product (Q4429689):
Displaying 23 items.
- Binary determinantal complexity (Q286175) (← links)
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Area-time tradeoff for rectangular matrix multiplication in VLSI models (Q796300) (← links)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- Fractal-like matrices (Q817032) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- Average-case complexity of the min-sum matrix product problem (Q897863) (← links)
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Identifying complexity by means of matrices (Q1850374) (← links)
- Efficient Bayesian inference of general Gaussian models on large phylogenetic trees (Q2245176) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Fast linear algebra is stable (Q2461610) (← links)
- Some algorithms related to matrices with entries in a finite field (Q3560577) (← links)
- Length Complexity of Tensor Products (Q3578225) (← links)
- REVISITING MATRIX PRODUCT ON MASTER-WORKER PLATFORMS (Q3606550) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Approximate computation of scalar products (Q5903776) (← links)
- Prototype based granular neuro-fuzzy system for regression task (Q6083041) (← links)
- Algorithm Design for Tensor Units (Q6487193) (← links)
- A refined laser method and faster matrix multiplication (Q6601301) (← links)
