On the number of arithmetical operations for finding Fibonacci numbers

DOI10.1016/0304-3975(89)90102-3zbMath0677.10007OpenAlexW2093852279WikidataQ59256061 ScholiaQ59256061MaRDI QIDQ1123222

Maurizio Talamo, Marco Protasi

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90102-3

zbMATH Keywords

complexityalgorithmsFibonacci numbersLucas numberscomputational number theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recurrences (11B37)

Related Items (3)

A fast algorithm for computing large Fibonacci numbers ⋮ On the computing of the generalized order-\(k\) Pell numbers in log time ⋮ The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods

Cites Work

• A presentation of the Fibonacci algorithm
• Computing Fibonacci numbers (and similarly defined functions) in log time
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• An Efficient Formula for Linear Recurrences

This page was built for publication: On the number of arithmetical operations for finding Fibonacci numbers