On the complexity of some data analysis problems (Q2996037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5884506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of some data analysis problems |
scientific article; zbMATH DE number 5884506 |
Statements
On the complexity of some data analysis problems (English)
0 references
4 May 2011
0 references
discrete optimization problem
0 references
complexity
0 references
NP-completeness
0 references
finding subsets of vectors in the Euclidean space
0 references
data analysis
0 references
0.8603318333625793
0 references
0.8181778192520142
0 references
0.797408401966095
0 references
0.7933979034423828
0 references
