Efficient methods of calculating the number of heapable permutations (Q2691575): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q761993 |
Changed an Item |
||
| Property / author | |||
| Property / author: Benjamin Chao-Min Chen / rank | |||
Normal rank | |||
Revision as of 05:54, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient methods of calculating the number of heapable permutations |
scientific article |
Statements
Efficient methods of calculating the number of heapable permutations (English)
0 references
29 March 2023
0 references
heapable sequences
0 references
greedy algorithm
0 references
extended signature
0 references
bounds
0 references
time complexity
0 references
