On the public citation graph
On the depth complexity of formulas
0 signed · 52 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.1007/bf00264256openalex-snapshot
Size-depth tradeoff in non-monotone Boolean formulae
inferredcites →https://doi.org/10.1007/bf00264580openalex-snapshot
Size-depth tradeoff in monotone Boolean formulae
inferredcites →https://doi.org/10.1016/0022-0000(78)90038-7openalex-snapshot
The circuit depth of symmetric boolean functions
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1137/0204009openalex-snapshot
Computational Complexity and Numerical Stability
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0208010openalex-snapshot
On the Parallel Evaluation of Multivariate Polynomials
inferredcites →https://doi.org/10.1145/321879.321882openalex-snapshot
Bounds to Complexities of Networks for Sorting and for Switching
inferredcites →https://doi.org/10.1145/321906.321916openalex-snapshot
Computer Search for Numerical Instability
inferredcites →https://doi.org/10.1145/321958.321973openalex-snapshot
Restructuring of Arithmetic Expressions For Parallel Evaluation
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.1998.0494openalex-snapshot
Lower Bounds on the Depth of Monotone Arithmetic Computations
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_103openalex-snapshot
On the size complexity of monotone formulas
inferred← citeshttps://doi.org/10.1007/978-3-030-62536-8_3openalex-snapshot
Regular Expression Length via Arithmetic Formula Complexity
inferred← citeshttps://doi.org/10.1007/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferred← citeshttps://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
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/s00224-014-9574-4openalex-snapshot
Lower Bounds for Tropical Circuits and Dynamic Programs
inferred← citeshttps://doi.org/10.1007/s11856-023-2510-zopenalex-snapshot
Shadows of Newton polytopes
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90061-2openalex-snapshot
A direct version of Shamir and Snir's lower bounds on monotone circuit depth
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90016-6openalex-snapshot
Short monotone formulae for the majority function
inferred← citeshttps://doi.org/10.1016/0898-1221(85)90103-8openalex-snapshot
Lower bounds on monotone arithmetic circuits with restricted depths
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.024openalex-snapshot
Lower bounds for monotone counting circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.023openalex-snapshot
Notes on Boolean read- k and multilinear circuits
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.09.003openalex-snapshot
Monotone separations for constant degree polynomials
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.013openalex-snapshot
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.10.004openalex-snapshot
Regular expression length via arithmetic formula complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114689openalex-snapshot
Monotone classes beyond VNP
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00130-3openalex-snapshot
A lower bound for monotone arithmetic circuits computing 0–1 permanent
inferred← citeshttps://doi.org/10.1109/ccc.1999.766267openalex-snapshot
Depth-3 arithmetic formulae over fields of characteristic zero
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267763openalex-snapshot
Lower bounds on the depth of monotone arithmetic computations
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492458openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferred← citeshttps://doi.org/10.1134/s1990478919040161openalex-snapshot
On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
inferred← citeshttps://doi.org/10.1137/0403021openalex-snapshot
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
inferred← citeshttps://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1137/15m1027310openalex-snapshot
Formulas versus Circuits for Small Distance Connectivity
inferred← citeshttps://doi.org/10.1137/16m1064738openalex-snapshot
Tropical Complexity, Sidon Sets, and Dynamic Programming
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/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferred← citeshttps://doi.org/10.1145/1060590.1060678openalex-snapshot
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
inferred← citeshttps://doi.org/10.1145/2591796.2591828openalex-snapshot
Formulas vs. circuits for small distance connectivity
inferred← citeshttps://doi.org/10.1145/322326.322341openalex-snapshot
Some Exact Complexity Results for Straight-Line Computations over Semirings
inferred← citeshttps://doi.org/10.1145/62212.62265openalex-snapshot
Monotone circuits for connectivity require super-logarithmic depth
inferred← citeshttps://doi.org/10.33048/daio.2019.26.643openalex-snapshot
On a relation between the depth and complexity of monotone Boolean formulas
inferred← citeshttps://doi.org/10.7146/brics.v2i43.19944openalex-snapshot
Lower Bounds on Arithmetic Circuits via Partial Derivatives (Preliminary Version)
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.