✦ LIBER ✦

An O(log n) algorithm for computing general order-k Fibonacci numbers

✍ Scribed by Thomas C. Wilson; Joseph Shortt

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Derivation of an O(k2 log n) algorithm f

✍ Alberto Pettorossi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 838 KB

An O(k2·log(n)) algorithm for computing

✍ Min-Sheng Lin 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB

An O(log n) algorithm for computing peri

✍ S.S. Lin; F.C. Lin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 240 KB

An O(k3·log(n/k)) algorithm for the cons

✍ Hwang, F.K.; Wright, P.E. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 293 KB

An O(n·(log2(n))2) algorithm for computi

✍ Belfore, L.A., II 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 428 KB

An O(log n) algorithm for computing the

✍ Friedrich J. Urbanek 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 166 KB