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. © 1989.

Protasi, M., & Talamo, M. (1989). On the number of arithmetical operations for finding Fibonacci numbers. THEORETICAL COMPUTER SCIENCE, 64(1), 119-124 [10.1016/0304-3975(89)90102-3].

On the number of arithmetical operations for finding Fibonacci numbers

TALAMO, MAURIZIO
1989

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. © 1989.
Pubblicato
Rilevanza internazionale
Articolo
Nessuno
Settore INF/01 - Informatica
English
Computer Metatheory; Arithmetical Operations; Computational Complexity; Fibonacci Numbers; Computer Programming
Protasi, M., & Talamo, M. (1989). On the number of arithmetical operations for finding Fibonacci numbers. THEORETICAL COMPUTER SCIENCE, 64(1), 119-124 [10.1016/0304-3975(89)90102-3].
Protasi, M; Talamo, M
Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2108/41905
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact