Pages that link to "Item:Q674405"
From MaRDI portal
The following pages link to Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405):
Displaying 20 items.
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- Localization vs. identification of semi-algebraic sets (Q1275351) (← links)
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
- On limited nondeterminism and the complexity of the V-C dimension (Q1816725) (← links)
- Exact VC-dimension of Boolean monomials (Q1847362) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions (Q1892207) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Using Vapnik-Chervonenkis dimension to analyze the testing complexity of program segments (Q1923104) (← links)
- Dot products in \(\mathbb{F}_q^3\) and the Vapnik-Chervonenkis dimension (Q2092325) (← links)
- Free resolutions of function classes via order complexes (Q2197912) (← links)
- Standard monomials and extremal point sets (Q2297739) (← links)
- On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations (Q2379679) (← links)
- Sample complexity for computational classification problems (Q2461637) (← links)
- Dimension Characterizations of Complexity Classes (Q5756668) (← links)
- Algorithmic Learning Theory (Q5897378) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
