| Autor: |
Er, M. C.1 |
| Zdroj: |
Computer Journal. 1983, Vol. 26 Issue 3, p224-227. 4p. |
| Abstrakt: |
A fast algorithm for computing order-k Fibonacci numbers in O(k2 lg n/2k) units of time is presented. Furthermore the time complexity of the algorithm is O((k−1)n) below threshold when n is small and k is large. Finally, the space complexity of this optimal algorithm is better than that of most other reported algorithms for doing the same task. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Library, Information Science & Technology Abstracts |
| Externí odkaz: |
|
