On the public citation graph

Graph complexity

https://doi.org/10.1007/bf00279952
0 signed · 55 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-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf00264314openalex-snapshot
Decomposition of graphs and monotone formula size of homogeneous functions
inferredcites →https://doi.org/10.1007/bf02579163openalex-snapshot
Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices
inferredcites →https://doi.org/10.1007/bfb0030339openalex-snapshot
On the complexity of slice functions
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1109/sfcs.1986.15openalex-snapshot
Complexity classes in communication complexity theory
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9783527670468.ch05openalex-snapshot
Computational Complexity of Graphs
inferred← citeshttps://doi.org/10.1002/9783527670468.ch06openalex-snapshot
The Linear Complexity of a Graph
inferred← citeshttps://doi.org/10.1002/jgt.20367openalex-snapshot
On set intersection representations of graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060404openalex-snapshot
Improved boolean formulas for the Ramsey graphs
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_35openalex-snapshot
The conjunctive complexity of quadratic boolean functions
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_67openalex-snapshot
Ramsey's theorem in bounded arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_5openalex-snapshot
On the Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_29openalex-snapshot
Remarks on Graph Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-79450-9_30openalex-snapshot
Pattern Matching in RNA Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/bf01204724openalex-snapshot
A combinatorial approach to complexity
inferred← citeshttps://doi.org/10.1007/bf02122698openalex-snapshot
Applications of matrix methods to the theory of lower bounds in computational complexity
inferred← citeshttps://doi.org/10.1007/s00037-018-0166-6openalex-snapshot
The Landscape of Communication Complexity Classes
inferred← citeshttps://doi.org/10.1007/s00037-024-00251-6openalex-snapshot
Limits of Preprocessing
inferred← citeshttps://doi.org/10.1007/s00224-002-1068-0openalex-snapshot
Graph Complexity and Slice Functions
inferred← citeshttps://doi.org/10.1007/s00453-006-0073-0openalex-snapshot
The Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00453-015-0104-9openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
inferred← citeshttps://doi.org/10.1007/s00454-022-00419-3openalex-snapshot
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube
inferred← citeshttps://doi.org/10.1007/s10986-012-9181-5openalex-snapshot
On the CNF-complexity of bipartite graphs containing no squares
inferred← citeshttps://doi.org/10.1007/s11227-026-08806-wopenalex-snapshot
Graph entropy-based node exposure score for risk assessment in information systems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90194-7openalex-snapshot
The conjunctive complexity of quadratic Boolean functions
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107528openalex-snapshot
Lower bounds for multicolor Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105579openalex-snapshot
An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
inferred← citeshttps://doi.org/10.1016/j.jom.2010.11.001openalex-snapshot
Structural investigation of supply networks: A social network analysis approach
inferred← citeshttps://doi.org/10.1016/j.patcog.2013.09.010openalex-snapshot
Depth-based complexity traces of graphs
inferred← citeshttps://doi.org/10.1016/j.patcog.2023.109877openalex-snapshot
QBER: Quantum-based Entropic Representations for un-attributed graphs
inferred← citeshttps://doi.org/10.1016/j.physa.2016.03.021openalex-snapshot
On the likelihood of forests
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114652openalex-snapshot
Generalisations of matrix partitions: Complexity and obstructions
inferred← citeshttps://doi.org/10.1017/s0963548306007620openalex-snapshot
On Graph Complexity
inferred← citeshttps://doi.org/10.1080/10511970.2013.843626openalex-snapshot
Personal, Expository, Critical, and Creative: Using Writing in Mathematics Courses
inferred← citeshttps://doi.org/10.1108/ijlm-01-2020-0039openalex-snapshot
Structure and complexity in six supply chains of the Brazilian wind turbine industry
inferred← citeshttps://doi.org/10.1109/focs.2008.19openalex-snapshot
The Sign-Rank of AC^O
inferred← citeshttps://doi.org/10.1109/syseng.2015.7302772openalex-snapshot
The domino effect in complex systems: An interdisciplinary view
inferred← citeshttps://doi.org/10.1137/080744037openalex-snapshot
The Sign-Rank of AC$^0$
inferred← citeshttps://doi.org/10.1137/s0097539705447001openalex-snapshot
Disproving the Single Level Conjecture
inferred← citeshttps://doi.org/10.1137/s0895480197318313openalex-snapshot
Dimension of Projections in Boolean Functions
inferred← citeshttps://doi.org/10.1145/1536414.1536479openalex-snapshot
On the complexity of communication complexity
inferred← citeshttps://doi.org/10.1145/2688073.2688074openalex-snapshot
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
inferred← citeshttps://doi.org/10.1145/3718746openalex-snapshot
Boolean Circuit Complexity and Two-Dimensional Cover Problems
inferred← citeshttps://doi.org/10.1186/s12859-016-0933-9openalex-snapshot
A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain
inferred← citeshttps://doi.org/10.1561/0400000011openalex-snapshot
Complexity Lower Bounds using Linear Algebra
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
inferred← citeshttps://doi.org/10.3390/e14030559openalex-snapshot
Entropy and the Complexity of Graphs Revisited
inferred← citeshttps://doi.org/10.4169/000298910x521634openalex-snapshot
Teaching Research: Encouraging Discoveries
inferred← citeshttps://doi.org/10.4230/dagsemproc.06111.8openalex-snapshot
Graphs and Circuits: Some Further Remarks
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:15)2023openalex-snapshot
Monoidal Width
inferred← citeshttps://doi.org/10.70675/ae746928z5283z4b71zbf96zc49f5007a4e6openalex-snapshot
On dichotomy above Feder and Vardi's logic
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.