Pages that link to "Item:Q1838293"

The following pages link to Derivation of an \(O(k^ 2\log n)\) algorithm for computing order-k Fibonacci numbers from the \(O(k^ 3\log n)\) matrix multiplication method (Q1838293):

Displaying 7 items.

• A fast algorithm for computing large Fibonacci numbers (Q294835) (← links)
• On the computing of the generalized order-\(k\) Pell numbers in log time (Q945394) (← links)
• Horner's rule and the computation of linear recurrences (Q1092939) (← links)
• Fast computation of solutions of linear difference equations by Er's rule (Q1187207) (← links)
• Computing sums of order-k Fibonacci numbers in log time (Q1838317) (← links)
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (Q3714128) (← links)
• An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space (Q3816136) (← links)