On the public citation graph
Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0020-0190(79)90113-3openalex-snapshot
O(n2.7799) complexity for n × n approximate matrix multiplication
inferredcites →https://doi.org/10.1016/0024-3795(71)90009-7openalex-snapshot
On multiplication of 2 × 2 matrices
inferredcites →https://doi.org/10.1016/0304-3975(78)90015-4openalex-snapshot
On varieties of optimal algorithms for the computation of bilinear mappings III. Optimal algorithms for the computation of xy and yx where x, yϵM2(K)
inferredcites →https://doi.org/10.1016/0304-3975(78)90038-5openalex-snapshot
On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping
inferredcites →https://doi.org/10.1016/0304-3975(78)90045-2openalex-snapshot
On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplication
inferredcites →https://doi.org/10.1090/s0002-9904-1976-13988-2openalex-snapshot
A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
inferredcites →https://doi.org/10.1109/sfcs.1978.34openalex-snapshot
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0202013openalex-snapshot
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
inferredcites →https://doi.org/10.1137/0209027openalex-snapshot
New Fast Algorithms for Matrix Operations
inferredcites →https://doi.org/10.1137/0209053openalex-snapshot
Approximate Solutions for the Bilinear Form Computational Problem
inferredcites →https://doi.org/10.1137/0210032openalex-snapshot
Partial and Total Matrix Multiplication
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_51openalex-snapshot
Backtrack searching in the presence of symmetry
inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_11openalex-snapshot
A Normal Form for Matrix Multiplication Schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_3openalex-snapshot
The Exact Non-commutative Algorithms
inferred← citeshttps://doi.org/10.1007/s00211-026-01531-9openalex-snapshot
Alternative Basis matrix multiplication is fast and stable†
inferred← citeshttps://doi.org/10.1007/s11075-024-01806-yopenalex-snapshot
Stability improvements for fast matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.cam.2021.113941openalex-snapshot
Equivalent polyadic decompositions of matrix multiplication tensors
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.05.011openalex-snapshot
On the inequivalence of bilinear algorithms for matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jpaa.2018.10.014openalex-snapshot
The geometry of rank decompositions of matrix multiplication II: 3 × 3 matrices
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.10.003openalex-snapshot
New ways to multiply 3 × 3-matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2024.12.011openalex-snapshot
On the local dimensions of solutions of Brent equations
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.012openalex-snapshot
Optimization techniques for small matrix multiplication
inferred← citeshttps://doi.org/10.1016/s0885-064x(02)00007-9openalex-snapshot
On the complexity of the multiplication of matrices of small formats
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1080/23799927.2020.1861104openalex-snapshot
Randomization of approximate bilinear computation for matrix multiplication
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00013openalex-snapshot
Alternative Basis Matrix Multiplication is Fast and Stable
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3107942openalex-snapshot
Improved Constructions for Secure Multi-Party Batch Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tevc.2011.2159270openalex-snapshot
Genetic Algorithms for Discovery of Matrix Multiplication Methods
inferred← citeshttps://doi.org/10.1134/s0001434626600390openalex-snapshot
On the Automorphism Group of a Possible Short Algorithm for Multiplying $$3\times 3$$ Matrices
inferred← citeshttps://doi.org/10.1134/s0965542513120129openalex-snapshot
The bilinear complexity and practical algorithms for matrix multiplication
inferred← citeshttps://doi.org/10.1137/15m1032168openalex-snapshot
Improving the Numerical Stability of Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/1940475.1940488openalex-snapshot
Optimization techniques for small matrix multiplication
inferred← citeshttps://doi.org/10.1145/2688500.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/2858788.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/3323165.3323188openalex-snapshot
Faster Matrix Multiplication via Sparse Decomposition
inferred← citeshttps://doi.org/10.1145/3364504openalex-snapshot
Matrix Multiplication, a Little Faster
inferred← citeshttps://doi.org/10.1145/3377006.3377015openalex-snapshot
A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications
inferred← citeshttps://doi.org/10.1145/3597066.3597099openalex-snapshot
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
inferred← citeshttps://doi.org/10.1145/3815436.3815461openalex-snapshot
Complex to Rational Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3816782.3819195openalex-snapshot
Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3392813/v1openalex-snapshot
Stability Improvements for Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.3103/s027864191801003xopenalex-snapshot
Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25
inferred← citeshttps://doi.org/10.3390/math13193064openalex-snapshot
Exploiting Generalized Cyclic Symmetry to Find Fast Rectangular Matrix Multiplication Algorithms Easier
inferred← citeshttps://doi.org/10.4213/mzm14586openalex-snapshot
О группе автоморфизмов предполагаемого короткого алгоритма для умножения $(3\times3)$-матриц
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2830openalex-snapshot
A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications
inferred← citeshttps://doi.org/10.48550/arxiv.1507.00687openalex-snapshot
Improving the numerical stability of fast matrix multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01110openalex-snapshot
Symmetries of matrix multiplication algorithms. I
inferred← citeshttps://doi.org/10.48550/arxiv.1612.01527openalex-snapshot
Matrix multiplication algorithms from group orbits
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04102openalex-snapshot
Fast Feasible and Unfeasible Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10192openalex-snapshot
New ways to multiply 3 x 3-matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03759openalex-snapshot
Sparsifying the Operators of Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2103.09592openalex-snapshot
Improved Constructions for Secure Multi-Party Batch Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05323openalex-snapshot
Characterization of Decomposition of Matrix Multiplication Tensors
inferred← citeshttps://doi.org/10.5555/642150.642151openalex-snapshot
Backtrack searching in the presence of symmetry
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.