<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>00038938</id>
  <dt>j</dt>
  <an>00038938</an>
  <augroup>
    <au>Er, M.C.</au>
  </augroup>
  <ti>Fast computation of solutions of linear difference equations by Er's rule.</ti>
  <so>Inf. Sci. 62, No.1-2, 1-11 (1992).</so>
  <py>1992</py>
  <pu>Elsevier Science Inc. (North-Holland), New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>linear difference equation</ut>
    <ut>algorithm</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0020-0255(92)90021-Y</li>
  </ligroup>
  <abgroup>
    <ab>A linear difference equation of $k$-th order is considered. An efficient algorithm for the computation of the $n$-th element of the solution is presented. This algorithm only uses $O(k\sp 2\log({n\over k}))$ time and $O(k)$ space for performing the task and is better than previously known results.</ab>
    <rv>J.Kalinowski (Katowice)</rv>
  </abgroup>
</item>