Counting Pop-Stacked Permutations in Polynomial Time (Q6042966)
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 7682063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting Pop-Stacked Permutations in Polynomial Time |
scientific article; zbMATH DE number 7682063 |
Statements
Counting Pop-Stacked Permutations in Polynomial Time (English)
0 references
4 May 2023
0 references
enumeration
0 references
pop-stacked permutation
0 references
polynomial time algorithm
0 references
automated fitting
0 references
differential approximation
0 references
0 references
0.9058097
0 references
0.8943897
0 references
0.8943897
0 references
0.88733447
0 references
0.88125366
0 references
0.87920886
0 references
0.8723415
0 references
0.87012845
0 references
0.8693374
0 references
