A new lower bound for deterministic pop-stack-sorting (Q6655684)
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 7960732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for deterministic pop-stack-sorting |
scientific article; zbMATH DE number 7960732 |
Statements
A new lower bound for deterministic pop-stack-sorting (English)
0 references
27 December 2024
0 references
pop-stack-sorting process
0 references
random permutations
0 references
0.8045012950897217
0 references
0.7664542198181152
0 references
0.7595885992050171
0 references
0.7593337893486023
0 references
0.7533093690872192
0 references
