Average case analysis of Gosper's algorithm for a class of urn model inputs

DOI10.1007/S00453-005-1173-YzbMATH Open1092.33019OpenAlexW2033829327MaRDI QIDQ818669FDOQ818669

Authors: N. E. Zubov 

Publication date: 21 March 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/41350

Recommendations

• A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
• Automatic average-case analysis of algorithms
• A generalization of Gosper's algorithm to bibasic hypergeometric summation
• Improvement of the degree setting in Gosper's algorithm
• Analytic analysis of algorithms

zbMATH Keywords

complexity analysishypergeometric termsGosper's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Cited In (3)

• Occupancy urn models in the analysis of algorithms
• A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
• Bounds for Turánians of modified Bessel functions

This page was built for publication: Average case analysis of Gosper's algorithm for a class of urn model inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818669)