An O(k<sup>2</sup>log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space (Q3816136)
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: An O(k2log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space |
scientific article; zbMATH DE number 4087745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(k<sup>2</sup>log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space |
scientific article; zbMATH DE number 4087745 |
Statements
An O(k<sup>2</sup>log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space (English)
0 references
1988
0 references
generalized order-k Fibonacci series
0 references
Fibonacci numbers
0 references
merging of strings
0 references
polyphase sort of \((k+1)\) tape drives
0 references
algorithms
0 references
0 references
0.7858611345291138
0 references
0.7758305668830872
0 references
0.7545081973075867
0 references
0.7526572942733765
0 references
