An algorithm to construct separable \(\epsilon\)-nets of two sets (Q508581)
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: An algorithm to construct separable -nets of two sets |
scientific article; zbMATH DE number 6681575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to construct separable \(\epsilon\)-nets of two sets |
scientific article; zbMATH DE number 6681575 |
Statements
An algorithm to construct separable \(\epsilon\)-nets of two sets (English)
0 references
7 February 2017
0 references
\(\epsilon\)-nets
0 references
VC-dimension
0 references
separation of sets
0 references
separating plane
0 references
0 references
0.90630841255188
0 references
0.9026237726211548
0 references
0.8508831858634949
0 references
0.7709758877754211
0 references
0.762702226638794
0 references
