A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Finding telescopers with minimal depth for indefinite nested sum and product expressions
2005
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05
Preserved Fulltext
We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.
doi:10.1145/1073884.1073924
dblp:conf/issac/Schneider05
fatcat:hp34cs5ebrbbbecj5kodrjbte4