Some Techniques for Solving Recurrences
ACM Computing Surveys (CSUR)
The automatic construction of pure recurrence relations
ACM SIGSAM Bulletin
Some reduction strategies for algebraic term rewriting
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
Recurrence relations (RR) play an important role in many domains of Science. Mathematics, Physics or Computer Science are obvious examples. It is rather intriguing to remark that few attempts to handle them as generic objects have been made in the field of Computer Algebra [24]. The only genuine effort is due to Verbaeten [1] who studied recurrence relations of hypergeometric functions. The same type of functions was considered by Lafferty [2], who was interested in reducing them to elementary or special functions by doing pattern matching with RR.