Exact upper bound for sorting \(R_n\) with LE (Q4965903)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7324416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact upper bound for sorting \(R_n\) with LE |
scientific article; zbMATH DE number 7324416 |
Statements
Exact upper bound for sorting Rn with LE (English)
0 references
18 March 2021
0 references
permutations
0 references
sorting
0 references
Cayley graphs
0 references
upper bound
0 references
set-rotate
0 references
pair-exchange
0 references
0 references
0.730083167552948
0 references
0.7127141356468201
0 references
0.7118694186210632
0 references
0.7116630673408508
0 references
0.7095779776573181
0 references
