An Asymptotic Stability Theorem for Divide-and-Conquer Sequences
Résumé
Divide-and-conquer is a popular strategy to design algorithms. It splits the input into several smaller subproblems, solving each subproblem separately, and then combine together to solve the original problem. The analysis of such divide-and-conquer algorithms naturally leads to divide-and-conquer recurrences. The present paper furnishes an asymptotic stability theorem, for a wide range of divide-and-conquer sequences, extending an established result.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |