An asymptotic theory for recurrence rela
✍
Hsien-Kuei Hwang; Tsung-Hsi Tsai
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 242 KB
We derive asymptotic approximations for the sequence f(n) deÿned recursively by f(n) = min16j¡n {f(j) + f(n -j)} + g(n), when the asymptotic behavior of g(n) is known. Our tools are general enough and applicable to another sequence F(n) = max16j¡n {F(j) + F(n -j) + min{g(j); g(n -j)}}, also frequent