On the complexity of constrained VC-classes (Q2478433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of constrained VC-classes |
scientific article; zbMATH DE number 5255187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of constrained VC-classes |
scientific article; zbMATH DE number 5255187 |
Statements
On the complexity of constrained VC-classes (English)
0 references
28 March 2008
0 references
Sauer's lemma
0 references
VC-dimension
0 references
Boolean functions
0 references
integer partitions
0 references
0 references
0.8774420619010925
0 references
0.7758537530899048
0 references
0.7750006318092346
0 references
0.7680948972702026
0 references
