Extremes in the Complexity of Computing Metric Distances Between Partitions (Q3313142)
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: Extremes in the Complexity of Computing Metric Distances Between Partitions |
scientific article; zbMATH DE number 3843006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremes in the Complexity of Computing Metric Distances Between Partitions |
scientific article; zbMATH DE number 3843006 |
Statements
Extremes in the Complexity of Computing Metric Distances Between Partitions (English)
0 references
1984
0 references
comparison of nonhierarchic classifications
0 references
complexity of algorithms
0 references
metric measures of distance
0 references
minimum-length sequence metrics
0 references
NP-complete problems
0 references
partitions of sets
0 references
0.7889776825904846
0 references
0.756584107875824
0 references
0.7505849003791809
0 references
0.7414101362228394
0 references
