Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method (Q1838293)
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: Derivation of an O(k^ 2 n) algorithm for computing order-k Fibonacci numbers from the O(k^ 3 n) matrix multiplication method |
scientific article; zbMATH DE number 3804838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method |
scientific article; zbMATH DE number 3804838 |
Statements
Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method (English)
0 references
1980
0 references
Fibonacci numbers
0 references
linear recurrence relations
0 references
iterative and recursive algorithm
0 references
matrix multiplication
0 references
