Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Hypergeometric dispersion and the orbit problem
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Rational normal forms and minimal decompositions of hypergeometric terms
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Computation with hyperexponential functions
ACM SIGSAM Bulletin
Polynomial ring automorphisms, rational (w,σ)-canonical forms, and the assignment problem
Journal of Symbolic Computation
Hi-index | 0.00 |
We propose four multiplicative canonical forms that exhibit the shift structure of a given rational function. These forms in particular allow one to represent a hypergeometric term efficiently. Each of these representations is optimal in some sense.