On the public citation graph

Tensor Rank: Some Lower and Upper Bounds

0 signed · 43 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/3-540-48224-5_7openalex-snapshot
Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical
inferredcites →https://doi.org/10.1007/978-1-4684-9458-7_1openalex-snapshot
Generalities on linear representations
inferredcites →https://doi.org/10.1007/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/bfb0035776openalex-snapshot
Tensor rank is NP-complete
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1016/0196-6774(90)90014-6openalex-snapshot
Tensor rank is NP-complete
inferredcites →https://doi.org/10.1016/0304-3975(75)90010-9openalex-snapshot
Die berechnungskomplexität der symbolischen differentiation von interpolationspolynomen
inferredcites →https://doi.org/10.1016/0304-3975(80)90060-2openalex-snapshot
Negation can be exponentially powerful
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/j.laa.2009.06.023openalex-snapshot
Rank of 3-tensors with 2 slices and Kronecker canonical forms
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/ccc.2011.28openalex-snapshot
Tensor Rank: Some Lower and Upper Bounds
inferredcites →https://doi.org/10.1109/sffcs.1999.814576openalex-snapshot
A 5/2n/sup 2/-lower bound for the rank of n×n-matrix multiplication over arbitrary fields
inferredcites →https://doi.org/10.1109/tc.1980.1675583openalex-snapshot
An Improved Lower Bound on Polynomial Multiplication
inferredcites →https://doi.org/10.1137/0208037openalex-snapshot
Optimal Evaluation of Pairs of Bilinear Forms
inferredcites →https://doi.org/10.1137/0214050openalex-snapshot
A Lower Bound for the Formula Size of Rational Functions
inferredcites →https://doi.org/10.1137/s0097539702405954openalex-snapshot
Lower Bounds for Matrix Product
inferredcites →https://doi.org/10.1137/s0097539704442118openalex-snapshot
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
inferredcites →https://doi.org/10.1145/1806689.1806780openalex-snapshot
Tensor-rank and lower bounds for arithmetic formulas
inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001533openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.17686/sced_rusnauka_2008-1040openalex-snapshot
10.17686/sced_rusnauka_2008-1040

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-319-05446-9_6openalex-snapshot
Explicit Tensors
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-29952-0_39openalex-snapshot
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
inferred← citeshttps://doi.org/10.1007/978-981-99-8739-9_8openalex-snapshot
Non-interactive Commitment from Non-transitive Group Actions
inferred← citeshttps://doi.org/10.1007/s00037-022-00228-3openalex-snapshot
A Lower Bound on Determinantal Complexity
inferred← citeshttps://doi.org/10.1007/s13348-025-00467-xopenalex-snapshot
Collineation varieties of tensors
inferred← citeshttps://doi.org/10.1016/j.laa.2026.02.030openalex-snapshot
The nondecreasing rank
inferred← citeshttps://doi.org/10.1109/ccc.2012.31openalex-snapshot
Complexity Lower Bounds through Balanced Graph Properties
inferred← citeshttps://doi.org/10.1109/focs.2019.00054openalex-snapshot
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2423694openalex-snapshot
Bayesian Robust Tensor Factorization for Incomplete Multiway Data
inferred← citeshttps://doi.org/10.1109/tpami.2015.2392756openalex-snapshot
Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
inferred← citeshttps://doi.org/10.1111/2041-210x.13480openalex-snapshot
Tensor decomposition for infectious disease incidence data
inferred← citeshttps://doi.org/10.1142/s0219749923500478openalex-snapshot
Classifying entanglement by algebraic geometry
inferred← citeshttps://doi.org/10.1145/2213977.2214036openalex-snapshot
Affine projections of polynomials
inferred← citeshttps://doi.org/10.1145/2535928openalex-snapshot
Tensor-Rank and Lower Bounds for Arithmetic Formulas
inferred← citeshttps://doi.org/10.1186/s13634-022-00928-6openalex-snapshot
EA-ADMM: noisy tensor PARAFAC decomposition based on element-wise average ADMM
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.1openalex-snapshot
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
inferred← citeshttps://doi.org/10.2140/ant.2022.16.1141openalex-snapshot
On the geometry of geometric rank
inferred← citeshttps://doi.org/10.22331/q-2024-01-31-1238openalex-snapshot
Persistent Tensors and Multiqudit Entanglement Transformation
inferred← citeshttps://doi.org/10.3390/math6120314openalex-snapshot
The Hitchhiker Guide to: Secant Varieties and Tensor Decomposition
inferred← citeshttps://doi.org/10.3390/rs12162582openalex-snapshot
An Optimized Filtering Method of Massive Interferometric SAR Data for Urban Areas by Online Tensor Decomposition
showing the first 21 of 22 · page through all 22
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.