On the average time complexity of computation with random partition (Q6536412)
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: On the average time complexity of computation with random partition |
scientific article; zbMATH DE number 7841121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the average time complexity of computation with random partition |
scientific article; zbMATH DE number 7841121 |
Statements
On the average time complexity of computation with random partition (English)
0 references
30 April 2024
0 references
divide-and-conquer
0 references
Stirling numbers of second kind
0 references
random partition
0 references
average-time complexity
0 references
0 references
0 references
