On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
From MaRDI portal
Publication:2379679
DOI10.1007/S10472-009-9148-3zbMATH Open1184.68417OpenAlexW2064379760MaRDI QIDQ2379679FDOQ2379679
J. L. Montaña, Luis Miguel Pardo
Publication date: 19 March 2010
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-009-9148-3
Recommendations
- VC Dimension Bounds for Analytic Algebraic Computations
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- On limited nondeterminism and the complexity of the V-C dimension
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Learnability and the Vapnik-Chervonenkis dimension
- On the Betti Numbers of Real Varieties
- A theory of the learnable
- Lower Bounds for Approximation by Nonlinear Manifolds
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Lower bounds for arithmetic networks
- Complexity lower bounds for computation trees with elementary transcendental function gates
- Title not available (Why is that?)
- VC Dimension Bounds for Analytic Algebraic Computations
Cited In (3)
This page was built for publication: On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379679)
