A Best Possible General Form of the Master Theorem for Divide-and-Conquer Recurrences
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909698477785088 |
|---|---|
| author | Offner, Carl D. |
| author_facet | Offner, Carl D. |
| contents | We give here a general, best-possible, and smoothly-derived form of the Master Theorem for divide-and-conquer recurrences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16064 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Best Possible General Form of the Master Theorem for Divide-and-Conquer Recurrences Offner, Carl D. Classical Analysis and ODEs Data Structures and Algorithms Combinatorics 41 F.2 We give here a general, best-possible, and smoothly-derived form of the Master Theorem for divide-and-conquer recurrences. |
| title | A Best Possible General Form of the Master Theorem for Divide-and-Conquer Recurrences |
| topic | Classical Analysis and ODEs Data Structures and Algorithms Combinatorics 41 F.2 |
| url | https://arxiv.org/abs/2507.16064 |