✦ LIBER ✦

Computing sums of order-k Fibonacci numbers in log time

✍ Scribed by M.C. Er

Book ID: 113162585
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 289 KB
Volume: 17
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90082-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log n) algorithm for computing gene

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

✍ Thomas C. Wilson; Joseph Shortt 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Computing Fibonacci numbers (and similar

Computing Fibonacci numbers (and similarly defined functions) in log time

✍ David Gries; Gary Levin 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Derivation of an O(k2 log n) algorithm f

Derivation of an O(k2 log n) algorithm for computing order-k fibonacci numbers from the O(k3log n) matrix multiplication method

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

A new method to compute the terms of gen

A new method to compute the terms of generalized order-k Fibonacci numbers

✍ Kaygısız, Kenan; Şahin, Adem 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Asymptotics for the logarithm of the num

Asymptotics for the logarithm of the number of (k, l)-sum-free sets in groups of prime order

✍ V. G. Sargsyan 📂 Article 📅 2012 🏛 Allerton Press, Inc. 🌐 English ⚖ 252 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2007 Volume 4708 || A Linear Time Algorithm for the k Maximal Sums Problem

✍ Kučera, Luděk; Kučera, Antonín 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 536 KB

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks add