On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
From MaRDI portal
Publication:2379679
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
- scientific article; zbMATH DE number 3908819 (Why is no real title available?)
- scientific article; zbMATH DE number 1222560 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- A theory of the learnable
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Complexity lower bounds for computation trees with elementary transcendental function gates
- Learnability and the Vapnik-Chervonenkis dimension
- Lower Bounds for Approximation by Nonlinear Manifolds
- Lower bounds for arithmetic networks
- On the Betti Numbers of Real Varieties
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- 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)
