On the public citation graph

Deciding the k-dimension is PSPACE-complete

0 signed · 25 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.1006/inco.1998.2709openalex-snapshot
Optimal Mistake Bound Learning Is Hard
inferredcites →https://doi.org/10.1006/jcss.1998.1602openalex-snapshot
Deciding the Vapnik–Červonenkis Dimension is∑p3-complete
inferredcites →https://doi.org/10.1007/bf00116827openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/sct.1993.336545openalex-snapshot
On limited nondeterminism and the complexity of the V-C dimension

What points at this work

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

inferred← citeshttps://doi.org/10.1145/3241304openalex-snapshot
Hardness of Approximation Between P and NP
inferred← citeshttps://doi.org/10.1145/3241304.3241305openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3241304.3241306openalex-snapshot
The Frontier of Intractability
inferred← citeshttps://doi.org/10.1145/3241304.3241307openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1145/3241304.3241308openalex-snapshot
Communication complexity of approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241309openalex-snapshot
Brouwer's fixed point
inferred← citeshttps://doi.org/10.1145/3241304.3241310openalex-snapshot
PPAD-hardness of approximation
inferred← citeshttps://doi.org/10.1145/3241304.3241311openalex-snapshot
The generalized circuit problem
inferred← citeshttps://doi.org/10.1145/3241304.3241312openalex-snapshot
Many-player games
inferred← citeshttps://doi.org/10.1145/3241304.3241313openalex-snapshot
Bayesian Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241314openalex-snapshot
Market equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241315openalex-snapshot
CourseMatch
inferred← citeshttps://doi.org/10.1145/3241304.3241316openalex-snapshot
Birthday Repetition
inferred← citeshttps://doi.org/10.1145/3241304.3241317openalex-snapshot
Densest k-subgraph
inferred← citeshttps://doi.org/10.1145/3241304.3241318openalex-snapshot
Community detection
inferred← citeshttps://doi.org/10.1145/3241304.3241319openalex-snapshot
VC and Littlestone's dimensions
inferred← citeshttps://doi.org/10.1145/3241304.3241320openalex-snapshot
Signaling
inferred← citeshttps://doi.org/10.1145/3241304.3241321openalex-snapshot
2-player approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241322openalex-snapshot
References
inferred← citeshttps://doi.org/10.48550/arxiv.1705.09517openalex-snapshot
Inapproximability of VC Dimension and Littlestone's Dimension
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.