On the public citation graph

A Multilinear Generalization of Yates's Algorithm

https://doi.org/10.2139/ssrn.4861163
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-322-80291-0_6openalex-extracted
Approximation Algorithms
inferredcites →https://doi.org/10.1007/bf02165411openalex-extracted
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/s00037-021-00217-yopenalex-extracted
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
inferredcites →https://doi.org/10.1016/0024-3795(71)90009-7openalex-extracted
On multiplication of 2 × 2 matrices
inferredcites →https://doi.org/10.1038/142090a0openalex-extracted
The Design and Analysis of Factorial Experiments
inferredcites →https://doi.org/10.1137/070683933openalex-extracted
Set Partitioning via Inclusion-Exclusion
inferredcites →https://doi.org/10.1137/1.9781611970999openalex-extracted
Computational Frameworks for the Fast Fourier Transform
inferredcites →https://doi.org/10.1137/1.9781611976465.32openalex-extracted
A Refined Laser Method and Faster Matrix Multiplication
inferredcites →https://doi.org/10.1145/3087556.3087579openalex-extracted
Matrix Multiplication, a Little Faster
inferredcites →https://doi.org/10.1145/3323165.3323188openalex-extracted
Faster Matrix Multiplication via Sparse Decomposition
inferredcites →https://doi.org/10.1145/3364504openalex-extracted
Matrix Multiplication, a Little Faster
inferredcites →https://doi.org/10.1147/rd.255.0825openalex-extracted
Algebraic Complexity Theory
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-extracted
The Art of Computer Programming
inferredcites →https://doi.org/10.1515/crll.1988.384.102openalex-extracted
The asymptotic spectrum of tensors.
inferredcites →https://doi.org/10.4086/toc.2021.v017a002openalex-extracted
inferredcites →https://doi.org/10.4230/lipics.ccc.2019.26openalex-extracted
Barriers for fast matrix multiplication from irreversibility
inferredcites →https://doi.org/10.4230/lipics.itcs.2019.7openalex-extracted
Tensor Network Complexity of Multilinear Maps
inferredcites →https://doi.org/10.46298/theoretics.24.21openalex-extracted
A Refined Laser Method and Faster Matrix Multiplication
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.