NP-completeness of some problems of a vectors subset choice (Q3115233)
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: NP-completeness of some problems of a vectors subset choice |
scientific article; zbMATH DE number 6007872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of some problems of a vectors subset choice |
scientific article; zbMATH DE number 6007872 |
Statements
20 February 2012
0 references
choice of a vector subset
0 references
clustering
0 references
algorithmic complexity
0 references
NP-completeness
0 references
0.9382138848304749
0 references
0.8790821433067322
0 references
0.873063325881958
0 references
0.8603318333625793
0 references
0.8510770201683044
0 references
