On Solving Recurrences
博士 === 國立臺灣大學 === 資訊工程學研究所 === 89 === It is inevitable to solve a recurrence for algorithm evaluation. Knuth introduces many famous concrete methods. Among them, generating function is the most powerful, but a large portion of them are still basic tricks...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14822225166992325004 |