On the public citation graph
Rapid Multiplication of Rectangular Matrices
0 signed · 77 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.1016/0898-1221(81)90009-2openalex-snapshot
New combinations of methods for the acceleration of matrix multiplications
inferredcites →https://doi.org/10.1137/0205041openalex-snapshot
On the Number of Multiplications Required for Matrix Multiplication
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.1006/jcom.1997.0438openalex-snapshot
Rectangular Matrix Multiplication Revisited
inferred← citeshttps://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_7openalex-snapshot
From Partial to Total Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_36openalex-snapshot
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP
inferred← citeshttps://doi.org/10.1007/978-3-319-19962-7_28openalex-snapshot
Bad Directions in Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_35openalex-snapshot
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_42openalex-snapshot
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_9openalex-snapshot
Cryptography from Learning Parity with Noise
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-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00037-025-00264-9openalex-snapshot
Barriers for rectangular matrix multiplication
inferred← citeshttps://doi.org/10.1007/s11425-007-0169-2openalex-snapshot
Fast rectangular matrix multiplication and some applications
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90054-6openalex-snapshot
On the arithmetic complexity of matrix Kronecker powers
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90173-7openalex-snapshot
Parallel evaluation of the determinant and of the inverse of a matrix
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90054-3openalex-snapshot
On the asymptotic complexity of rectangular matrix multiplication
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.2009.01.010openalex-snapshot
A note on compressed sensing and the complexity of matrix multiplication
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00003-6openalex-snapshot
Using fast matrix multiplication to find basic solutions
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1080/27684830.2024.2388334openalex-snapshot
Revisiting “Rapid multiplication of rectangular matrices”
inferred← citeshttps://doi.org/10.1090/s0025-5718-1983-0701639-4openalex-snapshot
Factoring Large Numbers with a Quadratic Sieve
inferred← citeshttps://doi.org/10.1090/s0025-5718-1987-0878705-xopenalex-snapshot
A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00944-2openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferred← citeshttps://doi.org/10.1109/focs.2012.80openalex-snapshot
Faster Algorithms for Rectangular Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/focs.2013.51openalex-snapshot
Klee's Measure Problem Made Easy
inferred← citeshttps://doi.org/10.1109/focs.2016.57openalex-snapshot
Polynomial Representations of Threshold Functions and Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/focs.2019.00028openalex-snapshot
Quasilinear Time List-Decodable Codes for Space Bounded Channels
inferred← citeshttps://doi.org/10.1109/focs.2019.00067openalex-snapshot
Efficient Construction of Rigid Matrices Using an NP Oracle
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00029openalex-snapshot
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00130openalex-snapshot
Faster Matrix Multiplication via Asymmetric Hashing
inferred← citeshttps://doi.org/10.1109/ipdps.2013.80openalex-snapshot
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3176197openalex-snapshot
Fully Connected Networks on a Diet With the Mediterranean Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/1.9781611973730.17openalex-snapshot
More Applications of the Polynomial Method to Algorithm Design
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch87openalex-snapshot
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
inferred← citeshttps://doi.org/10.1137/1.9781611975031.67openalex-snapshot
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
inferred← citeshttps://doi.org/10.1137/1.9781611975994.39openalex-snapshot
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
inferred← citeshttps://doi.org/10.1137/1028149openalex-snapshot
Author’s Comments on Don Coppersmith’s Review
inferred← citeshttps://doi.org/10.1137/110846373openalex-snapshot
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
inferred← citeshttps://doi.org/10.1137/15m1024524openalex-snapshot
Faster All-Pairs Shortest Paths via Circuit Complexity
inferred← citeshttps://doi.org/10.1137/20m1322297openalex-snapshot
Efficient Construction of Rigid Matrices Using an NP Oracle
inferred← citeshttps://doi.org/10.1137/21m1418654openalex-snapshot
From Circuit Complexity to Faster All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1137/21m1443339openalex-snapshot
Kronecker Products, Low-Depth Circuits, and Matrix Rigidity
inferred← citeshttps://doi.org/10.1142/9789813272880_0182openalex-snapshot
APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS
inferred← citeshttps://doi.org/10.1145/225058.225166openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferred← citeshttps://doi.org/10.1145/2591796.2591811openalex-snapshot
Faster all-pairs shortest paths via circuit complexity
inferred← citeshttps://doi.org/10.1145/2591796.2591858openalex-snapshot
New algorithms and lower bounds for circuits with linear threshold gates
inferred← citeshttps://doi.org/10.1145/266670.266679openalex-snapshot
Fast rectangular matrix multiplications and improving parallel matrix computations
inferred← citeshttps://doi.org/10.1145/3357713.3384266openalex-snapshot
Approximating text-to-pattern Hamming distances
inferred← citeshttps://doi.org/10.1145/3402926openalex-snapshot
Deterministic APSP, Orthogonal Vectors, and More
inferred← citeshttps://doi.org/10.1145/3470861openalex-snapshot
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
inferred← citeshttps://doi.org/10.1145/3519935.3520025openalex-snapshot
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals
inferred← citeshttps://doi.org/10.1145/3564246.3585147openalex-snapshot
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms
inferred← citeshttps://doi.org/10.1364/oe.431842openalex-snapshot
Time-averaged image projection through a multimode fiber
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33013207openalex-snapshot
High Dimensional Clustering with r-nets
inferred← citeshttps://doi.org/10.1609/aaai.v36i6.20662openalex-snapshot
Fast Graph Neural Tangent Kernel via Kronecker Sketching
inferred← citeshttps://doi.org/10.17706/ijcee.2017.9.2.430-438openalex-snapshot
Comparing CPU and GPU Implementations of a Simple Matrix Multiplication Algorithm
inferred← citeshttps://doi.org/10.23889/suthesis.63943openalex-snapshot
Efficient Algorithms for Artificial Neural Networks and Explainable AI
inferred← citeshttps://doi.org/10.4036/iis.2014.1openalex-snapshot
Proving Circuit Lower Bounds in High Uniform Classes
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.29openalex-snapshot
Counting Short Vector Pairs by Inner Product and Relations to the Permanent
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2017.39openalex-snapshot
Dominance Product and High-Dimensional Closest Pair under L_infty
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.23openalex-snapshot
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.8openalex-snapshot
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6680openalex-snapshot
Faster all-pairs shortest paths via circuit complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2444openalex-snapshot
New algorithms and lower bounds for circuits with linear threshold gates
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.2004.07470openalex-snapshot
Faster Dynamic Matrix Inverse for Faster LPs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.11503openalex-snapshot
Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle
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.