Title of article
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
Author/Authors
Nobuki Takayama، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
15
From page
637
To page
651
Abstract
A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions
Journal title
Journal of Symbolic Computation
Serial Year
1995
Journal title
Journal of Symbolic Computation
Record number
805114
Link To Document