1 citations · 1 across the 1 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2020
Efficient q-Integer Linear Decomposition of Multivariate Polynomials
Mark Giesbrecht, Hui Huang, George Labahn +1
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hyper…
cs.SC2019
Efficient Rational Creative Telescoping
Mark Giesbrecht, Hui Huang, George Labahn +1
We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the importa…
cs.SC2007★ 1 cited
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
Howard Cheng, Guillaume Hanrot, Emmanuel Thomé +2
The currently best known algorithms for the numerical evaluation of hypergeometric constants such as to decimal digits have time complexity and space…