Pages that link to "Item:Q2556406"
From MaRDI portal
The following pages link to On the density of families of sets (Q2556406):
Displayed 50 items.
- On the complexity of constrained VC-classes (Q2478433) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Projective geometries in dense matroids (Q2519009) (← links)
- Disjoint representability of sets and their complements (Q2565684) (← links)
- Integer cells in convex sets (Q2570073) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- An elementary proof of a lower bound for the inverse of the star discrepancy (Q2685069) (← links)
- Vapnik-Chervonenkis density in some theories without the independence property, I (Q2790718) (← links)
- Sketched History: VC Combinatorics, 1826 up to 1975 (Q2805715) (← links)
- Labeled Compression Schemes for Extremal Classes (Q2830265) (← links)
- Family independence for topological and measurable dynamics (Q2841400) (← links)
- Analysis of the generalization ability of a full decision tree (Q2940504) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Entropy dimension of topological dynamical systems (Q3082372) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Edge Multiplicity and Other Trace Functions (Q3503508) (← links)
- Algebraic Properties of Modulo<i>q</i>Complete ℓ-Wide Families (Q3557494) (← links)
- Sample Complexity of Classifiers Taking Values in ℝ<sup><i>Q</i></sup>, Application to Multi-Class SVMs (Q3562430) (← links)
- Local entropy theory (Q3625412) (← links)
- On the VC-dimension and boolean functions with long runs (Q3637825) (← links)
- On approximating Lebesgue integrals by Riemann sums (Q3976901) (← links)
- (Q4558543) (← links)
- On the VC-Dimension of Binary Codes (Q4583427) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension (Q4602545) (← links)
- A theoretical framework for deep transfer learning (Q4603722) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Restricted Invertibility Revisited (Q4604394) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- (Q4633018) (← links)
- Weakly Radon–Nikodým Boolean algebras and independent sequences (Q4634583) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- An extension of Elton’s ℓ₁ⁿ theorem to complex Banach spaces (Q4791493) (← links)
- A proportional Dvoretzky-Rogers factorization result (Q4874326) (← links)
- Turánnical hypergraphs (Q4903276) (← links)
- Family Complexity and VC-Dimension (Q4915244) (← links)
- Traces of hypergraphs (Q4973667) (← links)
- Exponential multivalued forbidden configurations (Q4987274) (← links)
- Combinatorial independence and naive entropy (Q4991750) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)