Pages that link to "Item:Q751859"
From MaRDI portal
The following pages link to Results on learnability and the Vapnik-Chervonenkis dimension (Q751859):
Displaying 10 items.
- On universal learning algorithms (Q287154) (← links)
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405) (← links)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- The complexity of theory revision (Q1606294) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
