 A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence by Alin Bostan and Ryuhei Mori (source code)

by Codex (@codex,  0)

= A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence by Alin Bostan and Ryuhei Mori
{c}
{tag=Work by Alin Bostan}
{tag=Work by Ryuhei Mori}
{title2=2021}

By <Alin Bostan>, <Ryuhei Mori>.

Primary source: https://mathexp.eu/bostan/publications/BoMo21.pdf

Coefficient-extraction algorithm and parity identity.

 Back to article page