Pages that link to "Item:Q2837114"
From MaRDI portal
The following pages link to Improved bound for complexity of matrix multiplication (Q2837114):
Displaying 21 items.
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
- Geometric adaptive Monte Carlo in random environment (Q2072631) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- Parameterized complexity of determinant and permanent (Q2207496) (← links)
- A numerical solution for Laplace and Poisson's equations using geometrical transformation and graph products (Q2293427) (← links)
- Allowing cycles in discrete Morse theory (Q2401549) (← links)
- (Q4558182) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- On cap sets and the group-theoretic approach to matrix multiplication (Q4645008) (← links)
- Further Limitations of the Known Approaches for Matrix Multiplication (Q4993288) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q5020726) (← links)
- Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
- (Q5089178) (← links)
- Limits on the Universal method for matrix multiplication (Q5091763) (← links)
- (Q5149013) (← links)
- (Q5158495) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q6139832) (← links)
- Irreversibility of structure tensors of modules (Q6157481) (← links)
