On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On the complexity of some Euclidean optimal summing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of certain problems of searching for subsets of vectors and cluster analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Data Mining / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5483032 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1064562416060089 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2571047813 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of some Euclidean problems of partitioning a finite set of points |
scientific article |
Statements
On the complexity of some Euclidean problems of partitioning a finite set of points (English)
0 references
11 April 2017
0 references
0 references
