On the public citation graph

Deciding the Vapnik–Červonenkis Dimension is∑p3-complete

0 signed · 66 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.1995.1053openalex-snapshot
Quantifying the Amount of Verboseness
inferredcites →https://doi.org/10.1006/inco.1995.1115openalex-snapshot
Approximable Sets
inferredcites →https://doi.org/10.1007/3-540-57370-4_52openalex-snapshot
On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
inferredcites →https://doi.org/10.1007/3-540-57370-4_54openalex-snapshot
Complexity of computing Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1007/3-540-57370-4_58openalex-snapshot
The VC-dimensions of finite automata with n states
inferredcites →https://doi.org/10.1007/3-540-59042-0_104openalex-snapshot
Computability of convex sets
inferredcites →https://doi.org/10.1007/3-540-60246-1_123openalex-snapshot
On a quantitative notion of uniformity
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bfb0099432openalex-snapshot
A course on empirical processes
inferredcites →https://doi.org/10.1016/0001-8708(88)90069-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1016/0304-3975(94)00163-dopenalex-snapshot
On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
inferredcites →https://doi.org/10.1109/sct.1993.336545openalex-snapshot
On limited nondeterminism and the complexity of the V-C dimension
inferredcites →https://doi.org/10.1109/sfcs.1988.21930openalex-snapshot
Results on learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/129712.129746openalex-snapshot
Computational learning theory
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.5802/aif.938openalex-snapshot
Densité et dimension

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-0-387-30164-8_875openalex-snapshot
VC Dimension
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_881-1openalex-snapshot
VC Dimension
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_881openalex-snapshot
VC Dimension
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_48openalex-snapshot
Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits
inferred← citeshttps://doi.org/10.1007/s00153-015-0445-8openalex-snapshot
PAC learning, VC dimension, and the arithmetic hierarchy
inferred← citeshttps://doi.org/10.1007/s00373-010-0964-3openalex-snapshot
The Cycle Discrepancy of Three-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00454-018-0046-5openalex-snapshot
Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109057openalex-snapshot
From undecidability of non-triviality and finiteness to undecidability of learnability
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106429openalex-snapshot
A note on hardness of computing recursive teaching dimension
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.003openalex-snapshot
Bounded fixed-parameter tractability and log 2 n nondeterministic bits
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.016openalex-snapshot
On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.017openalex-snapshot
A hierarchy of local decision
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00022-3openalex-snapshot
On the complexity of approximating the VC dimension
inferred← citeshttps://doi.org/10.1017/s1471068419000140openalex-snapshot
Beyond NP: Quantifying over Answer Sets
inferred← citeshttps://doi.org/10.1109/18.971739openalex-snapshot
Links between complexity theory and constrained block coding
inferred← citeshttps://doi.org/10.1109/ccc.2000.856750openalex-snapshot
Deciding the k-dimension is PSPACE-complete
inferred← citeshttps://doi.org/10.1109/ccc.2001.933889openalex-snapshot
On the complexity of approximating the VC dimension
inferred← citeshttps://doi.org/10.1109/ccc.2001.933890openalex-snapshot
Links between complexity theory and constrained block coding
inferred← citeshttps://doi.org/10.1109/focs.2008.54openalex-snapshot
On the Hardness of Being Truthful
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814619openalex-snapshot
Hardness of approximating Σ/sub 2//sup p/ minimization problems
inferred← citeshttps://doi.org/10.1137/s0097539704441642openalex-snapshot
The Complexity of Finding Paths in Graphs with Bounded Independence Number
inferred← citeshttps://doi.org/10.1145/1060590.1060609openalex-snapshot
Beyond NP
inferred← citeshttps://doi.org/10.1145/230514.571643openalex-snapshot
Technical Report Column
inferred← citeshttps://doi.org/10.1145/2852040.2852052openalex-snapshot
Complexity Theory Column 89
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.1145/3531130.3533330openalex-snapshot
Computable PAC Learning of Continuous Features
inferred← citeshttps://doi.org/10.1145/582475.582484openalex-snapshot
SIGACT news complexity theory comun 37
inferred← citeshttps://doi.org/10.1145/601819.601829openalex-snapshot
SIGACT news complexity theory column 38
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.118openalex-snapshot
A Hierarchy of Local Decision
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.