scientific article; zbMATH DE number 977919

MaRDI QIDQ4332153zbMATH OpenFDO

Authors Arie Rokach

Publication date 26 November 2001

Mathematics Subject Classification ID

Calculation of integer sequences (11Y55)

Recommendations

• A fast algorithm for computing large Fibonacci numbers
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• Improved algorithms for the calculation of Fibonacci numbers
• scientific article; zbMATH DE number 1807669
• On the number of arithmetical operations for finding Fibonacci numbers

Cited in

(6)

• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• A fast algorithm for computing large Fibonacci numbers
• Improved algorithms for the calculation of Fibonacci numbers
• scientific article; zbMATH DE number 5778105 (Why is no real title available?)
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• scientific article; zbMATH DE number 6034 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332153)