Derivation of an O(k2 log n) algorithm for computing order-k fibonacci numbers from the O(k3log n) matrix multiplication method
- 12 December 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (4-5) , 172-179
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- An O(log n) algorithm for computing general order-k Fibonacci numbersInformation Processing Letters, 1980
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977