A master theorem for discrete divide and conquer recurrences (Q5365047)
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 6783399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A master theorem for discrete divide and conquer recurrences |
scientific article; zbMATH DE number 6783399 |
Statements
29 September 2017
0 references
Boncelet's data compression algorithm
0 references
Dirichlet series
0 references
Mellin-Perron formula
0 references
Tauberian theorem
0 references
divide-and-conquer recurrence
0 references
0.9926581382751464
0 references
0.8025781512260437
0 references
0.7975306510925293
0 references
