Pages that link to "Item:Q3947117"
From MaRDI portal
The following pages link to On the Asymptotic Complexity of Matrix Multiplication (Q3947117):
Displaying 50 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Certifying algorithms (Q465678) (← links)
- The Hackbusch conjecture on tensor formats (Q496420) (← links)
- Speedup for natural problems and noncomputability (Q620964) (← links)
- A note on border rank (Q794161) (← links)
- On commutativity and approximation (Q799369) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Improved lower bounds for some matrix multiplication problems (Q1068534) (← links)
- The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
- Computing dominators in parallel (Q1108035) (← links)
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field (Q1111375) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- Reply to the paper ''The numerical instability of Bini's algorithm'' (Q1162356) (← links)
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- A note on two-way nondeterministic pushdown automata (Q1170034) (← links)
- Revisiting matrix squaring (Q1176519) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- A Method to Compute Minimal Polynomials (Q3735078) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- On cap sets and the group-theoretic approach to matrix multiplication (Q4645008) (← links)
- Fast parallel algorithms for polynomial division over an arbitrary field of constants (Q4723298) (← 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)
- On computation of the Bessel function by summing up the series (Q5043040) (← links)
- (Q5089178) (← links)
- Limits on the Universal method for matrix multiplication (Q5091763) (← links)
