A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (Q3714128): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:31, 5 February 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
A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (English)
0 references
1986
0 references
computational number theory
0 references
recursive algorithm
0 references
Fibonacci numbers
0 references
Dijkstra's methodology
0 references
