NP-hardness of the computation of a median equivalence relation in classification (Régnier problem) (Q5412503): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:11, 9 February 2024
scientific article; zbMATH DE number 6289029
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of the computation of a median equivalence relation in classification (Régnier problem) |
scientific article; zbMATH DE number 6289029 |
Statements
NP-hardness of the computation of a median equivalence relation in classification (Régnier problem) (English)
0 references
25 April 2014
0 references
aggregation of relations
0 references
classification
0 references
complexity
0 references
equivalence relation
0 references
NP-completeness
0 references
median relation
0 references
partition
0 references
Régnier's problem
0 references
symmetric difference distance
0 references
Zahn's problem
0 references
