On the VC-dimension and boolean functions with long runs
From MaRDI portal
Publication:3637825
DOI10.1080/09720529.2007.10698116zbMath1180.06014OpenAlexW2034675182MaRDI QIDQ3637825
Publication date: 14 July 2009
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2007.10698116
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Edge domination in Boolean function graph B(L(G), NINC) of a graph ⋮ On the complexity of constrained VC-classes
Cites Work
- Unnamed Item
- Unnamed Item
- On the density of sets of vectors
- \(\epsilon\)-nets and simplex range queries
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- On the trace of finite sets
- The Vapnik-Chervonenkis dimension of a random graph
- Compound Poisson approximation: A user's guide
- A generalization of Sauer's lemma
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Scale-sensitive dimensions, uniform convergence, and learnability
- Neural Network Learning
- Advanced Lectures on Machine Learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Convergence of stochastic processes
This page was built for publication: On the VC-dimension and boolean functions with long runs
