Computational complexity of problems in classification according to a relation matrix
Statements of the problem of classification according to a relation matrix with the use of numerical criteria (functionals) of the connectivity of elements in a subset are discussed. It is proved that, given certain assumptions about the connectivity functional, the corresponding classification problem is NP complete.
scientific article; zbMATH DE number 3978377