Complexity of certain problems of searching for subsets of vectors and cluster analysis (Q2995693)
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: Complexity of certain problems of searching for subsets of vectors and cluster analysis |
scientific article; zbMATH DE number 5884242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of certain problems of searching for subsets of vectors and cluster analysis |
scientific article; zbMATH DE number 5884242 |
Statements
Complexity of certain problems of searching for subsets of vectors and cluster analysis (English)
0 references
4 May 2011
0 references
discrete extremal problem
0 references
complexity
0 references
NP-completeness
0 references
search for subsets
0 references
cluster analysis
0 references
pattern recognition
0 references
