An algorithm for finding recurrence relations of binomial sums and its complexity (Q1918484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding recurrence relations of binomial sums and its complexity |
scientific article; zbMATH DE number 906752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for finding recurrence relations of binomial sums and its complexity |
scientific article; zbMATH DE number 906752 |
Statements
An algorithm for finding recurrence relations of binomial sums and its complexity (English)
0 references
4 November 1996
0 references
recurrence relations
0 references
hypergeometric functions
0 references
0.90420765
0 references
0.89317846
0 references
0.8929675
0 references
0.8883356
0 references
0.88521796
0 references
0.88358855
0 references
0.8747933
0 references
