On the public citation graph
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
0 signed · 161 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/0041-5553(65)90065-0openalex-snapshot
Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations
inferredcites →https://doi.org/10.1070/rm1966v021n01abeh004147openalex-snapshot
METHODS OF COMPUTING VALUES OF POLYNOMIALS
inferredcites →https://doi.org/10.1073/pnas.58.5.1840openalex-snapshot
ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
inferredcites →https://doi.org/10.1109/tc.1968.227420openalex-snapshot
A New Algorithm for Inner Product
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nla.70096openalex-snapshot
On the Computation of Tensor Functions under Tensor‐Tensor Multiplications with Linear Maps
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_206openalex-snapshot
On memory requirements of Strassen's algorithms
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_173openalex-snapshot
A fast non-commutative algorithm for matrix multiplication
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_34openalex-snapshot
The algorithmic complexity of linear algebras
inferred← citeshttps://doi.org/10.1007/978-3-031-74430-3_7openalex-snapshot
Challenges in Parallel Matrix Chain Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_3openalex-snapshot
The Exact Non-commutative Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_8openalex-snapshot
Summary of Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_7openalex-snapshot
An Adaptive Prefix-Assignment Technique for Symmetry Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_2openalex-snapshot
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-48895-5_22openalex-snapshot
Filtering for Random Finite Group Homomorphic Sequential Systems
inferred← citeshttps://doi.org/10.1007/bf01140212openalex-snapshot
Dual problems of multiplication of a vector by a matrix
inferred← citeshttps://doi.org/10.1007/bf02252257openalex-snapshot
Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix-Multiplikation
inferred← citeshttps://doi.org/10.1007/bfb0039157openalex-snapshot
On the number of multiplications required by the product of two matrices
inferred← citeshttps://doi.org/10.1007/bfb0055078openalex-snapshot
Bulk-synchronous parallel multiplication of boolean matrices
inferred← citeshttps://doi.org/10.1007/pl00008264openalex-snapshot
Memory-Efficient Matrix Multiplication in the BSP Model
inferred← citeshttps://doi.org/10.1007/s00037-018-0164-8openalex-snapshot
Tensor surgery and tensor rank
inferred← citeshttps://doi.org/10.1007/s000370050028openalex-snapshot
Lower bounds for the multiplicative complexity of matrix multiplication
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/s10444-019-09715-8openalex-snapshot
Computing images of polynomial maps
inferred← citeshttps://doi.org/10.1007/s11227-011-0730-1openalex-snapshot
A parallel implementation of Strassen’s matrix multiplication algorithm for wormhole-routed all-port 2D torus networks
inferred← citeshttps://doi.org/10.1007/s40305-019-00280-xopenalex-snapshot
An Introduction to the Computational Complexity of Matrix Multiplication
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90078-8openalex-snapshot
Commutativity, non-commutativity, and bilinearity
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90016-xopenalex-snapshot
Improved lower bounds for some matrix multiplication problems
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90065-7openalex-snapshot
Gaussian elimination is optimal for solving linear equations in dimension two
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90108-0openalex-snapshot
A noncommutative algorithm for multiplying 5 × 5 matrices using 102 multiplications
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90005-8openalex-snapshot
Some elementary proofs of lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90012-5openalex-snapshot
On the optimal evaluation of a set of bilinear forms
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90052-6openalex-snapshot
Global properties of tensor rank
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90143-5openalex-snapshot
On the direct sum conjecture
inferred← citeshttps://doi.org/10.1016/0041-5553(77)90022-2openalex-snapshot
The lower bound of the number of multiplication operations for calculating the product of hankel matrices
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90019-7openalex-snapshot
On the complexity of some algorithms of matrix multiplication
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90014-6openalex-snapshot
Tensor rank is NP-complete
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90070-0openalex-snapshot
On the algorithmic complexity of associative algebras
inferred← citeshttps://doi.org/10.1016/0771-050x(75)90005-4openalex-snapshot
A survey of techniques in applied computational complexity
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90133-2openalex-snapshot
Complexities of special matrix multiplication problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-417750-5.50008-7openalex-snapshot
HORNERS RULE IS UNIQUELY OPTIMAL
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
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.jsc.2022.05.002openalex-snapshot
Fast commutative matrix algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102240openalex-snapshot
Skew-polynomial-sparse matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.laa.2017.12.015openalex-snapshot
The tensor rank of tensor product of two three-qubit W states is eight
inferred← citeshttps://doi.org/10.1016/j.laa.2017.12.020openalex-snapshot
Tensor rank is not multiplicative under the tensor product
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.012openalex-snapshot
Optimization techniques for small matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.029openalex-snapshot
Improved method for finding optimal formulas for bilinear maps in a finite field
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90179-1openalex-snapshot
On the algebraic structure of certain partially observable finite-state Markov processes
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80029-2openalex-snapshot
Fast modular transforms
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.1023/a:1013588221172openalex-snapshot
Bulk-Synchronous Parallel Gaussian Elimination
inferred← citeshttps://doi.org/10.1038/s41586-022-05172-4openalex-snapshot
Discovering faster matrix multiplication algorithms with reinforcement learning
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1080/03081087508817107openalex-snapshot
An extended duality theorem and multiplication of several matrices
inferred← citeshttps://doi.org/10.1080/03155986.1974.11731565openalex-snapshot
On The Complexity Of Symmetric Computations *
inferred← citeshttps://doi.org/10.1090/s0002-9904-1976-13988-2openalex-snapshot
A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
inferred← citeshttps://doi.org/10.1090/s0273-0979-08-01176-2openalex-snapshot
Geometry and the complexity of matrix multiplication
inferred← citeshttps://doi.org/10.1090/s0894-0347-05-00506-0openalex-snapshot
The border rank of the multiplication of 2×2 matrices is seven
inferred← citeshttps://doi.org/10.1109/ipdps.2013.80openalex-snapshot
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00058openalex-snapshot
Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00059openalex-snapshot
Computation of Matrix Chain Products on Parallel Machines
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00013openalex-snapshot
Alternative Basis Matrix Multiplication is Fast and Stable
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174167openalex-snapshot
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21922openalex-snapshot
A lower bound for matrix multiplication
inferred← citeshttps://doi.org/10.1109/synasc49474.2019.00011openalex-snapshot
Using Numerical Insights to Improve Symbolic Computations
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3032196openalex-snapshot
Coded Computing for Resilient, Secure, and Privacy-Preserving Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tit.2019.2963864openalex-snapshot
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb14107.xopenalex-snapshot
COMPUTATIONAL COMPLEXITY: ALGORITHMS WITH FEWEST OPERATIONS
inferred← citeshttps://doi.org/10.1134/s0081543813070079openalex-snapshot
On the exact and approximate bilinear complexities of multiplication of 4×2 and 2×2 matrices
inferred← citeshttps://doi.org/10.1134/s0965542508020024openalex-snapshot
Computation of the commutator of 2 × 2 matrices via five multiplications
inferred← citeshttps://doi.org/10.1134/s0965542513120129openalex-snapshot
The bilinear complexity and practical algorithms for matrix multiplication
inferred← citeshttps://doi.org/10.1134/s0965542515040168openalex-snapshot
A bilinear algorithm of length 22 for approximate multiplication of 2 × 7 and 7 × 2 matrices
inferred← citeshttps://doi.org/10.1134/s0965542524701021openalex-snapshot
Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares
inferred← citeshttps://doi.org/10.1134/s1064562424702223openalex-snapshot
Semi-Analytical Solution of Brent Equations
inferred← citeshttps://doi.org/10.1137/0201012openalex-snapshot
Computational Complexity of Iterative Processes
inferred← citeshttps://doi.org/10.1137/0202013openalex-snapshot
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
inferred← citeshttps://doi.org/10.1137/0204004openalex-snapshot
Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) over a Noncommutative Ring (Auxiliary Functions Allowed)
inferred← citeshttps://doi.org/10.1137/0204009openalex-snapshot
Computational Complexity and Numerical Stability
inferred← citeshttps://doi.org/10.1137/0205041openalex-snapshot
On the Number of Multiplications Required for Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/0207006openalex-snapshot
An Extension of Computational Duality to Sequences of Bilinear Computations
inferred← citeshttps://doi.org/10.1137/0208037openalex-snapshot
Optimal Evaluation of Pairs of Bilinear Forms
inferred← citeshttps://doi.org/10.1137/0209027openalex-snapshot
New Fast Algorithms for Matrix Operations
inferred← citeshttps://doi.org/10.1137/0209056openalex-snapshot
On the Complexity of Bilinear Forms with Commutativity
inferred← citeshttps://doi.org/10.1137/0210032openalex-snapshot
Partial and Total Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/0215043openalex-snapshot
Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/0218052openalex-snapshot
A Lower Bound for Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/1.9780898718027.ch23openalex-snapshot
23. Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/17m1131970openalex-snapshot
A Counterexample to Comon's Conjecture
inferred← citeshttps://doi.org/10.1137/20m1349254openalex-snapshot
The Waring Rank of the 3 x 3 Permanent
inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/23m1547159openalex-snapshot
More on Tensors with Different Rank and Symmetric Rank
inferred← citeshttps://doi.org/10.1145/130069.130111openalex-snapshot
A note on checking matrix products (extended abstract)
inferred← citeshttps://doi.org/10.1145/1478873.1478936openalex-snapshot
Establishing lower bounds on algorithms
inferred← citeshttps://doi.org/10.1145/1478873.1478986openalex-snapshot
Theory of computing in computer science education
inferred← citeshttps://doi.org/10.1145/165939.165960openalex-snapshot
A massively parallel optimizer for expression evaluation
inferred← citeshttps://doi.org/10.1145/1940475.1940488openalex-snapshot
Optimization techniques for small matrix multiplication
inferred← citeshttps://doi.org/10.1145/2395116.2395121openalex-snapshot
Graph expansion and communication costs of fast 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/2755573.2755594openalex-snapshot
Matrix Multiplication I/O-Complexity by Path Routing
inferred← citeshttps://doi.org/10.1145/2858788.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/3087556.3087579openalex-snapshot
Matrix Multiplication, a Little Faster
inferred← citeshttps://doi.org/10.1145/322217.322231openalex-snapshot
Computations of Bilinear Forms over Finite Fields
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/3452143.3465537openalex-snapshot
The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89
inferred← citeshttps://doi.org/10.1145/3558481.3591083openalex-snapshot
Multiplying 2 × 2 Sub-Blocks Using 4 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/3597066.3597120openalex-snapshot
Flip Graphs for Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3666000.3669701openalex-snapshot
Adaptive Flip Graph Algorithm for Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3712020.3712021openalex-snapshot
Some New Non-Commutative Matrix Multiplication Algorithms of Size ( n, m , 6)
inferred← citeshttps://doi.org/10.1145/3747199.3747555openalex-snapshot
Faster search for tensor decomposition over finite fields
inferred← citeshttps://doi.org/10.1145/3747199.3747566openalex-snapshot
Flip Graphs with Symmetry and New Matrix Multiplication Schemes
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.1145/800119.803910openalex-snapshot
Computational complexity and numerical stability
inferred← citeshttps://doi.org/10.1145/800125.804038openalex-snapshot
Duality applied to the complexity of matrix multiplications and other bilinear forms
inferred← citeshttps://doi.org/10.1145/800125.804039openalex-snapshot
On the optimal evaluation of a set of bilinear forms
inferred← citeshttps://doi.org/10.1145/800133.804345openalex-snapshot
Optimal evaluation of pairs of bilinear forms
inferred← citeshttps://doi.org/10.1145/800135.804413openalex-snapshot
On the complexity of bilinear forms with commutativity
inferred← citeshttps://doi.org/10.1155/1996/284218openalex-snapshot
Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications
inferred← citeshttps://doi.org/10.1201/9781420010572.pt3copenalex-snapshot
Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1201/9781420046076-c9openalex-snapshot
Complexity Theory of Transforms in Signal Processing
inferred← citeshttps://doi.org/10.2140/pjm.2025.334.143openalex-snapshot
Several remarks on tensor rank computation
inferred← citeshttps://doi.org/10.24425/bpasts.2022.140535openalex-snapshot
Matrix black box algorithms - a survey
inferred← citeshttps://doi.org/10.3103/s027864191801003xopenalex-snapshot
Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25
inferred← citeshttps://doi.org/10.3103/s027864192302005xopenalex-snapshot
The Approximate Bilinear Complexity of the Multiplication of Matrices of Sizes $$2\times n$$ and $$n\times 4$$
inferred← citeshttps://doi.org/10.3103/s0278641923040155openalex-snapshot
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field
inferred← citeshttps://doi.org/10.31857/s2686954324040056openalex-snapshot
Semi-analytical solution of Brent equations
inferred← citeshttps://doi.org/10.4213/dm1804openalex-snapshot
О билинейной сложности умножения $3\times 2$ матрицы на $2\times 3$ матрицу
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.4213/spm47openalex-snapshot
О точной и приближенной билинейных сложностях умножения матриц размеров $4\times2$ и $2\times2$
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.33openalex-snapshot
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication
inferred← citeshttps://doi.org/10.4310/acta.2019.v222.n2.a3openalex-snapshot
Counterexamples to Strassen’s direct sum conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1408.6273openalex-snapshot
On symmetries of the Strassen algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1411.5414openalex-snapshot
Fast Matrix Multiplication: Limitations of the Laser Method
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01110openalex-snapshot
Symmetries of matrix multiplication algorithms. I
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01559openalex-snapshot
How hard is the tensor rank?
inferred← citeshttps://doi.org/10.48550/arxiv.1612.01527openalex-snapshot
Matrix multiplication algorithms from group orbits
inferred← citeshttps://doi.org/10.48550/arxiv.1706.04225openalex-snapshot
Inner Rank and Lower Bounds for Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1712.08660openalex-snapshot
A counterexample to Strassen's direct sum conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04102openalex-snapshot
Fast Feasible and Unfeasible Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07683openalex-snapshot
Fast Commutative Matrix Algorithm
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.2011.15082openalex-snapshot
Parity-Checked Strassen Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.math/0407224openalex-snapshot
The border rank of the multiplication of two by two matrices is seven
inferred← citeshttps://doi.org/10.5802/ccirm.9openalex-snapshot
Algorithmes rapides pour les polynômes, séries formelles et matrices
inferred← citeshttps://doi.org/10.70675/37f9ff4azdaafz4e8fzb9f7zf19e85ca969bopenalex-snapshot
Multiplication algorithms : bilinear complexity and fast asymptotic methods
inferred← citeshttps://doi.org/10.70675/9f0e60e5z4ad1z4e15z995az0c1adb8758e5openalex-snapshot
Estimation of structured tensor models and recovery of low-rank tensors
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.