Petkovšek's algorithm is a computer algebra algorithm that computes a basis of hypergeometric terms solution of its input linear recurrence equation with polynomial coefficients. Equivalently, it computes a first order right factor of linear difference operators with polynomial coefficients.
- Marko Petkovsek, Herbert Wilf and Doron Zeilberger, The book "A = B"
|This combinatorics-related article is a stub. You can help Wikipedia by expanding it.|