On the Complexity of Matrix Product
From MaRDI portal
Recommendations
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- Linear Circuits over $\operatorname{GF}(2)$
- Lower Bounds for Matrix Product
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth
Cited in
(33)- A direct version of Shamir and Snir's lower bounds on monotone circuit depth
- Matrix rigidity of random Toeplitz matrices
- Identifying complexity by means of matrices
- Efficient Bayesian inference of general Gaussian models on large phylogenetic trees
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
- Fast linear algebra is stable
- Binary determinantal complexity
- A note on the use of determinant for proving lower bounds on the size of linear circuits
- Linear Circuits over $\operatorname{GF}(2)$
- Some algorithms related to matrices with entries in a finite field
- Length Complexity of Tensor Products
- Lower bounds on the bounded coefficient complexity of bilinear maps
- REVISITING MATRIX PRODUCT ON MASTER-WORKER PLATFORMS
- scientific article; zbMATH DE number 1264875 (Why is no real title available?)
- Lower Bounds for Matrix Product
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- A super-quadratic lower bound for depth four arithmetic circuits
- Lower bounds for the matrix chain ordering problem (extended abstract)
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
- Arithmetic circuit lower bounds via MaxRank
- Approximate computation of scalar products
- Prototype based granular neuro-fuzzy system for regression task
- Algorithm design for tensor units
- A refined laser method and faster matrix multiplication
- On matrix multiplication and polynomial identity testing
- Removing the log factor from (,+)-products on bounded range integer matrices
- Kronecker products, low-depth circuits, and matrix rigidity
- Area-time tradeoff for rectangular matrix multiplication in VLSI models
- Size-depth trade-offs for monotone arithmetic circuits
- Bit complexity of matrix products
- Fractal-like matrices
- Fast matrix multiplication is stable
- Average-case complexity of the min-sum matrix product problem
This page was built for publication: On the Complexity of Matrix Product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429689)
