A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (Q3714128): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4144755 / 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: Q3925859 / 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: 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
Property / cites work
 
Property / cites work: An O(log n) algorithm for computing general order-k Fibonacci numbers / rank
 
Normal rank

Latest revision as of 12:09, 17 June 2024

scientific article
Language Label Description Also known as
English
A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
scientific article

    Statements

    Identifiers