Pages that link to "Item:Q1148672"
From MaRDI portal
The following pages link to Computing Fibonacci numbers (and similarly defined functions) in log time (Q1148672):
Displaying 16 items.
- A fast algorithm for computing large Fibonacci numbers (Q294835) (← links)
- Fast computation of periodic continued fractions (Q750520) (← links)
- An O(log n) algorithm for computing periodic continued fractions and its applications (Q750524) (← links)
- On the computing of the generalized order-\(k\) Pell numbers in log time (Q945394) (← links)
- A presentation of the Fibonacci algorithm (Q1057303) (← links)
- Horner's rule and the computation of linear recurrences (Q1092939) (← links)
- On the number of arithmetical operations for finding Fibonacci numbers (Q1123222) (← links)
- On the logarithmic evaluation of recurrence relations (Q1183470) (← links)
- Fast computation of solutions of linear difference equations by Er's rule (Q1187207) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Computing sums of order-k Fibonacci numbers in log time (Q1838317) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Improved algorithms for the calculation of Fibonacci numbers (Q3512197) (← links)
- A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (Q3714128) (← links)
- An O(k<sup>2</sup>log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space (Q3816136) (← links)
- Efficient computation of terms of linear recurrence sequences of any order (Q5384249) (← links)
