Algorithms for constructing the shortest allowable partitions of finite sets (Q5146089)
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: Algorithms for constructing the shortest allowable partitions of finite sets |
scientific article; zbMATH DE number 7300330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for constructing the shortest allowable partitions of finite sets |
scientific article; zbMATH DE number 7300330 |
Statements
25 January 2021
0 references
0.8260501623153687
0 references
0.7737783193588257
0 references
0.7480922341346741
0 references
0.7356882691383362
0 references
0.7336775064468384
0 references
