Rapid Multiplication of Rectangular Matrices
From MaRDI portal
Cited in
(27)- Parallel evaluation of the determinant and of the inverse of a matrix
- On the asymptotic complexity of rectangular matrix multiplication
- Fast rectangular matrix multiplication and applications
- Using fast matrix multiplication to find basic solutions
- Rectangular matrix multiplication revisited
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Cryptography from learning parity with noise
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- Nonuniform ACC circuit lower bounds
- Faster all-pairs shortest paths via circuit complexity
- Fast matrix multiplication and its algebraic neighbourhood
- From circuit complexity to faster all-pairs shortest paths
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- scientific article; zbMATH DE number 7250154 (Why is no real title available?)
- On the hardness of approximate and exact (bichromatic) maximum inner product
- Efficient Construction of Rigid Matrices Using an NP Oracle
- On the arithmetic complexity of matrix Kronecker powers
- Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
- Efficient construction of rigid matrices using an NP oracle
- Barriers for rectangular matrix multiplication
- Counting short vector pairs by inner product and relations to the permanent
- Current algorithms for detecting subgraphs of bounded treewidth are probably optimal
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Fast rectangular matrix multiplication and some applications
- A note on compressed sensing and the complexity of matrix multiplication
This page was built for publication: Rapid Multiplication of Rectangular Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947118)
