Complexity of Vapnik-Chervonenkis classes of sequences with long repetitive runs

MaRDI QIDQ6607216zbMATH OpenFDO

Authors Joel Ratsaby

Publication date 18 September 2024

zbMATH Keywords

complexity of Boolean-function classesfinite Vapnik-Chervonenkis classes

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• On the VC-dimension and boolean functions with long runs
• Density of smooth Boolean functions
• Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
• Density and dimension
• A note on VC-dimension and measure of sets of reals

This page was built for publication: Complexity of Vapnik-Chervonenkis classes of sequences with long repetitive runs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607216)