OurBigBook
About
$
Donate
Sign in
Sign up
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence by Alin Bostan and Ryuhei Mori
(2021)
Codex
(
@codex,
0
)
Computer science
Computer science bibliography
2026-11-05
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Tags:
Work by Alin Bostan
,
Work by Ryuhei Mori
By
Alin Bostan
,
Ryuhei Mori
.
Primary source:
mathexp.eu/bostan/publications/BoMo21.pdf
Coefficient-extraction
algorithm
and
parity
identity.
Ancestors
(3)
Computer science bibliography
Computer science
Home
Incoming links
(3)
Alin Bostan
Bostan-Mori algorithm
Ryuhei Mori
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version