Programming and Computer Software

, Volume 37, Issue 2, pp 78–86

Rational solutions of linear difference equations: Universal denominators and denominator bounds

Authors

    • Dorodnicyn Computing CenterRussian Academy of Sciences
  • A. Gheffar
    • XLIMUniversit@e de Limoges, CNRS
  • D. E. Khmelnov
    • Dorodnicyn Computing CenterRussian Academy of Sciences
Article

DOI: 10.1134/S0361768811020022

Cite this article as:
Abramov, S.A., Gheffar, A. & Khmelnov, D.E. Program Comput Soft (2011) 37: 78. doi:10.1134/S0361768811020022

Abstract

Complexities of some well-known algorithms for finding rational solutions of linear difference equations with polynomial coefficients are studied.

Download to read the full article text

Copyright information

© Pleiades Publishing, Ltd. 2011