Computational complexity of problems in classification according to a relation matrix (Q1083849)
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: Computational complexity of problems in classification according to a relation matrix |
scientific article; zbMATH DE number 3978377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of problems in classification according to a relation matrix |
scientific article; zbMATH DE number 3978377 |
Statements
Computational complexity of problems in classification according to a relation matrix (English)
0 references
1985
0 references
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.
0 references
connectivity functional
0 references
NP complete
0 references
0 references
0.88535744
0 references
0.8646244
0 references
0 references
0.85430354
0 references
