On the public citation graph
On the Additive Complexity of Matrix Multiplication
0 signed · 46 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.1002/cpa.3160230204openalex-snapshot
On the number of multiplications necessary to compute certain functions
inferredcites →https://doi.org/10.1007/3-540-06841-4_78openalex-snapshot
Efficient Procedures for Using Matrix Algorithms
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_1openalex-snapshot
Evaluation of Rational Functions
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_4openalex-snapshot
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0024-3795(71)90008-5openalex-snapshot
On the algebraic complexity of inner product
inferredcites →https://doi.org/10.1080/03155986.1974.11731565openalex-snapshot
On The Complexity Of Symmetric Computations *
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/s00500-016-2259-yopenalex-snapshot
Ant colony optimization for triple product property triples to fast 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(95)00176-xopenalex-snapshot
On the additive complexity of 2 × 2 matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.004openalex-snapshot
On the arithmetic complexity of Strassen-like matrix multiplications
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.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.1090/s0025-5718-2014-02857-3openalex-snapshot
A fast algorithm for reversion of power series
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00013openalex-snapshot
Alternative Basis Matrix Multiplication is Fast and Stable
inferred← citeshttps://doi.org/10.1109/pdp.2015.24openalex-snapshot
A Vector Implementation of Gaussian Elimination over GF(2): Exploring the Design-Space of Strassen's Algorithm as a Case Study
inferred← citeshttps://doi.org/10.1109/siu49456.2020.9302383openalex-snapshot
Fault-Tolerant Strassen-Like Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/soac.1991.143920openalex-snapshot
On the 2*2 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/1.9780898718027.ch23openalex-snapshot
23. 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/1837934.1837987openalex-snapshot
A Strassen-like matrix multiplication suited for squaring and higher power computation
inferred← citeshttps://doi.org/10.1145/2312005.2312044openalex-snapshot
Communication-optimal parallel algorithm for strassen's 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/3087556.3087579openalex-snapshot
Matrix Multiplication, a Little Faster
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/3558481.3591083openalex-snapshot
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications
inferred← citeshttps://doi.org/10.1145/359131.359134openalex-snapshot
Storage reorganization techniques for matrix computation in a paging environment
inferred← citeshttps://doi.org/10.1145/3597066.3597099openalex-snapshot
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
inferred← citeshttps://doi.org/10.1145/369028.369096openalex-snapshot
Implementation of Strassen's algorithm for matrix multiplication
inferred← citeshttps://doi.org/10.1145/800191.805516openalex-snapshot
A note on matrix multiplication in a paging environment
inferred← citeshttps://doi.org/10.3390/en17092225openalex-snapshot
Investigation of Energy and Power Characteristics of Various Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2117openalex-snapshot
Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4772openalex-snapshot
A fast algorithm for reversion of power series
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1145openalex-snapshot
Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04102openalex-snapshot
Fast Feasible and Unfeasible Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01554openalex-snapshot
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03759openalex-snapshot
Sparsifying the Operators of Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.5802/ccirm.9openalex-snapshot
Algorithmes rapides pour les polynômes, séries formelles et matrices
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.