On the public citation graph

Tensor-Rank and Lower Bounds for Arithmetic Formulas

0 signed · 59 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/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1007/s00037-009-0270-8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
inferredcites →https://doi.org/10.1007/s00037-011-0007-3openalex-snapshot
Homogeneous Formulas and Symmetric Polynomials
inferredcites →https://doi.org/10.1007/s002009900021openalex-snapshot
Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields
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(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/j.jcss.2010.06.013openalex-snapshot
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors
inferredcites →https://doi.org/10.1109/ccc.2011.28openalex-snapshot
Tensor Rank: Some Lower and Upper Bounds
inferredcites →https://doi.org/10.1109/focs.2008.32openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Four
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/070707932openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferredcites →https://doi.org/10.1145/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferredcites →https://doi.org/10.1145/1007352.1007378openalex-snapshot
Multilinear formulas and skepticism of quantum computing
inferredcites →https://doi.org/10.1145/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferredcites →https://doi.org/10.1145/276698.276872openalex-snapshot
An exponential lower bound for depth 3 arithmetic circuits
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.1515/crll.1973.264.184openalex-snapshot
Vermeidung von Divisionen.
inferredcites →https://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferredcites →https://doi.org/10.4086/toc.2006.v002a006openalex-snapshot
inferredcites →https://doi.org/10.4086/toc.2010.v006a007openalex-snapshot

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-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_30openalex-snapshot
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00037-011-0007-3openalex-snapshot
Homogeneous Formulas and Symmetric Polynomials
inferred← citeshttps://doi.org/10.1007/s00037-025-00283-6openalex-snapshot
Towards Optimal Depth-Reductions for Algebraic Formulas
inferred← citeshttps://doi.org/10.1007/s00037-026-00286-xopenalex-snapshot
On Approximate Symmetric Polynomials and Tightness of Homogenization Results
inferred← citeshttps://doi.org/10.1016/j.matpur.2016.11.004openalex-snapshot
Abelian tensors
inferred← citeshttps://doi.org/10.1016/j.matpur.2023.02.006openalex-snapshot
Weighted slice rank and a minimax correspondence to Strassen's spectra
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.301openalex-snapshot
Riffle Rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115214openalex-snapshot
Lower bounds for the sum of small-size algebraic branching programs
inferred← citeshttps://doi.org/10.1080/00927872.2015.1087534openalex-snapshot
Maximum Waring Ranks of Monomials and Sums of Coprime Monomials
inferred← citeshttps://doi.org/10.1090/proc/16156openalex-snapshot
A separation between tropical matrix ranks
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00083openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1112/jlms.12963openalex-snapshot
Subrank and optimal reduction of scalar multiplications to generic tensors
inferred← citeshttps://doi.org/10.1137/1.9781611975031.44openalex-snapshot
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
inferred← citeshttps://doi.org/10.1137/140957123openalex-snapshot
Arithmetic Circuits: A Chasm at Depth 3
inferred← citeshttps://doi.org/10.1137/16m1107632openalex-snapshot
Characterizing Propositional Proofs as Noncommutative Formulas
inferred← citeshttps://doi.org/10.1137/18m1191567openalex-snapshot
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
inferred← citeshttps://doi.org/10.1145/2984450.2984455openalex-snapshot
Algebraic proof complexity
inferred← citeshttps://doi.org/10.1145/3406325.3451096openalex-snapshot
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
inferred← citeshttps://doi.org/10.1145/3519935.3520044openalex-snapshot
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
inferred← citeshttps://doi.org/10.1145/3543685openalex-snapshot
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits
inferred← citeshttps://doi.org/10.1145/3544979.3544989openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3611094openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1145/3618260.3649760openalex-snapshot
On the Power of Homogeneous Algebraic Formulas
inferred← citeshttps://doi.org/10.1145/3717823.3718122openalex-snapshot
Asymptotic Tensor Rank Is Characterized by Polynomials
inferred← citeshttps://doi.org/10.1145/3717823.3718221openalex-snapshot
Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information
inferred← citeshttps://doi.org/10.1561/2200000057openalex-snapshot
Spectral Learning on Matrices and Tensors
inferred← citeshttps://doi.org/10.1561/9781680836417openalex-snapshot
Spectral Learning on Matrices and Tensors
inferred← citeshttps://doi.org/10.22331/q-2025-03-20-1664openalex-snapshot
What exactly does Bekenstein bound?
inferred← citeshttps://doi.org/10.22331/q-2025-11-20-1916openalex-snapshot
Topologically driven no-superposing theorem with a tight error bound
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a016openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2019.v015a013openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.29openalex-snapshot
On Multilinear Forms: Bias, Correlation, and Tensor Rank
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2017.31openalex-snapshot
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.37openalex-snapshot
Algebraic Hardness Versus Randomness in Low Characteristic
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.1607.00443openalex-snapshot
Algebraic Proof Complexity: Progress, Frontiers and Challenges
inferred← citeshttps://doi.org/10.48550/arxiv.2006.02374openalex-snapshot
On tensor rank and commuting matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01751openalex-snapshot
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
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.