NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 10:21, 16 July 2024

scientific article
Language Label Description Also known as
English
NP-hardness of some Euclidean problems of partitioning a finite set of points
scientific article

    Statements

    NP-hardness of some Euclidean problems of partitioning a finite set of points (English)
    0 references
    20 August 2018
    0 references
    partitioning
    0 references
    Euclidean space
    0 references
    norm of sum
    0 references
    NP-hardness
    0 references
    0 references
    0 references

    Identifiers