A fast algorithm for solving linearly recurrent sequences (Q4630320)
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 fast algorithm for solving linearly recurrent sequences |
scientific article; zbMATH DE number 7045173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for solving linearly recurrent sequences |
scientific article; zbMATH DE number 7045173 |
Statements
A fast algorithm for solving linearly recurrent sequences (English)
0 references
29 March 2019
0 references
linear recurrence relation
0 references
annihilating polynomial
0 references
0.8686501979827881
0 references
0.8385210037231445
0 references
0.8332124352455139
0 references
0.7814803123474121
0 references
