On the Number of Arithmetical Operations for Finding Fibonacci Numbers

Abstract

Two algorithms for finding Fibonacci numbers are presented. They are analyzed both from the worst case and average case point of view. The algorithms allow the number of arithmetical operations needed for solving the problem to be decreased. 
DOI: 10.1016/0304-3975(89)90102-3

Topics

Cite this paper

@article{Protasi1989OnTN, title={On the Number of Arithmetical Operations for Finding Fibonacci Numbers}, author={Marco Protasi and Maurizio Talamo}, journal={Theor. Comput. Sci.}, year={1989}, volume={64}, pages={119-124} }