A fast algorithm for computing large Fibonacci numbers (Q294835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sums of order-k Fibonacci numbers in log time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Computing Order-K Fibonacci Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Fibonacci numbers (and similarly defined functions) in log time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A presentation of the Fibonacci algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of arithmetical operations for finding Fibonacci numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interative program to calculate Fibonacci numbers in O(log n) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation / rank
 
Normal rank

Revision as of 03:50, 12 July 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for computing large Fibonacci numbers
scientific article

    Statements

    Identifiers