A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence (Q6538752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence |
scientific article; zbMATH DE number 7848182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence |
scientific article; zbMATH DE number 7848182 |
Statements
A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence (English)
0 references
14 May 2024
0 references
algebraic algorithms
0 references
computational complexity
0 references
linearly recurrent sequence
0 references
rational power series
0 references
fast Fourier transform
0 references
