On the public citation graph

A Lower Bound for the Formula Size of Rational Functions

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.
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-662-29244-0openalex-snapshot
Commutative Algebra
inferredcites →https://doi.org/10.1016/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1145/800133.804347openalex-snapshot
On the parallel evaluation of multivariate polynomials

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_4openalex-snapshot
Algebraic Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_5openalex-snapshot
A Selection of Lower Bounds for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_6openalex-snapshot
Explicit Tensors
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_10openalex-snapshot
Algebraic Independence and Blackbox Identity Testing
inferred← citeshttps://doi.org/10.1007/s00037-014-0085-0openalex-snapshot
Random arithmetic formulas can be reconstructed efficiently
inferred← citeshttps://doi.org/10.1007/s00037-018-0167-5openalex-snapshot
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits
inferred← citeshttps://doi.org/10.1007/s00037-019-00185-4openalex-snapshot
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
inferred← citeshttps://doi.org/10.1007/s00037-019-00186-3openalex-snapshot
A quadratic lower bound for homogeneous algebraic branching programs
inferred← citeshttps://doi.org/10.1007/s00037-022-00223-8openalex-snapshot
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
inferred← citeshttps://doi.org/10.1007/s00037-022-00228-3openalex-snapshot
A Lower Bound on Determinantal Complexity
inferred← citeshttps://doi.org/10.1007/s00037-024-00258-zopenalex-snapshot
Determinants vs. Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00220-023-04720-xopenalex-snapshot
Hay from the Haystack: Explicit Examples of Exponential Quantum Circuit Complexity
inferred← citeshttps://doi.org/10.1007/s00493-019-4009-0openalex-snapshot
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/s10958-017-3483-4openalex-snapshot
Lower Bounds for the Circuit Size of Partially Homogeneous Polynomials
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105900openalex-snapshot
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80063-9openalex-snapshot
Feasible arithmetic computations: Valiant's hypothesis
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06268-5openalex-snapshot
Algebraic independence in positive characteristic: A 𝑝-adic calculus
inferred← citeshttps://doi.org/10.1109/ccc.2011.28openalex-snapshot
Tensor Rank: Some Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1109/ccc.2013.10openalex-snapshot
Random Arithmetic Formulas Can Be Reconstructed Efficiently
inferred← citeshttps://doi.org/10.1109/focs.2004.9openalex-snapshot
Algebras with Polynomial Identities and Computing the Determinant
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00026openalex-snapshot
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits
inferred← citeshttps://doi.org/10.1137/130910725openalex-snapshot
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
inferred← citeshttps://doi.org/10.1137/18m1173319openalex-snapshot
The Computational Power of Depth Five Arithmetic Circuits
inferred← citeshttps://doi.org/10.1137/s0097539705447359openalex-snapshot
Algebras with Polynomial Identities and Computing the Determinant
inferred← citeshttps://doi.org/10.1137/s0097539793251761openalex-snapshot
On the Reuse of Additions in Matrix Multiplication
inferred← citeshttps://doi.org/10.1142/s1793557114500314openalex-snapshot
Types of depth and formula size
inferred← citeshttps://doi.org/10.1145/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferred← citeshttps://doi.org/10.1145/2213977.2214033openalex-snapshot
Jacobian hits circuits
inferred← citeshttps://doi.org/10.1145/2591796.2591847openalex-snapshot
A super-polynomial lower bound for regular arithmetic formulas
inferred← citeshttps://doi.org/10.1145/3460952openalex-snapshot
On Computing Multilinear Polynomials Using Multi- r -ic Depth Four 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/3689957openalex-snapshot
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1145/3778858openalex-snapshot
Lower Bounds for Planar Arithmetic Circuits
inferred← citeshttps://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferred← citeshttps://doi.org/10.16943/ptinsa/2017/49224openalex-snapshot
Improved Lower Bound for Multi-R-IC Depth Four Circuits as a Function of the Number of Input Variables
inferred← citeshttps://doi.org/10.22028/d291-47560openalex-snapshot
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
inferred← citeshttps://doi.org/10.4086/toc.2019.v015a013openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.30openalex-snapshot
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits
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.1702.05328openalex-snapshot
On algebraic branching programs of small width
inferred← citeshttps://doi.org/10.48550/arxiv.1803.05933openalex-snapshot
Some Closure Results for Polynomial Factorization and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11793openalex-snapshot
A Quadratic Lower Bound for Algebraic Branching Programs and Formulas
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.