Divide-and-conquer recurrences - Classification of asymptotics

被引：0
|
作者：
Derfel G. [1 ]
Vogl F. [2 ]
机构：
[1] Dept. of Mathematics and Computer Science, Ben Gurion University, Beer Sheva 84105
[2] Abt. F. Techn. Mathematik, TU Wien, A-1040 Wien
来源：
aequationes mathematicae | 2000年 / 60卷 / 3期
关键词：
Generate Function; Computer Science; Functional Equation; Recurrence Equation; Exponential Generate;
D O I：
10.1007/PL00000132
中图分类号：
学科分类号：
摘要：
We deal with a class of recurrence equations arising in the theory of algorithms, stochastic pocesses, computer science, etc. and give a classification theorem for asymptotics of their solutions. The method of the proof is based upon consideration of the exponential generating function, which is a solution of a linear nonhomogeneous functional equation with rescaling. © Birkhäuser Verlag, Basel, 2000.
引用
收藏
页码：243 / 257
页数：14
相关论文
共 50 条
12345