Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Improvement of the degree setting in Gosper's algorithm

From MaRDI portal
Publication:1314432
Jump to:navigation, search

DOI10.1006/jsco.1993.1043zbMath0872.33001OpenAlexW2131914309MaRDI QIDQ1314432

Petr Lisoněk, Paule, Peter, Strehl, Volker

Publication date: 20 February 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f9b11c60cc0e12ed6e7ae597c3c4115d63db11a


zbMATH Keywords

computational complexityhypergeometric seriesGosper's algorithmsummation algorithms


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to special functions (33-01)


Related Items (3)

On the structure of solutions to the key Gosper equation in problems of symbolic summation ⋮ Converging to Gosper's algorithm ⋮ Accelerating indefinite summation: simple classes of summands






This page was built for publication: Improvement of the degree setting in Gosper's algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1314432&oldid=13431543"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki