A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers (Q3714128): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02522667.1986.10698833 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061813384 / rank | |||
Normal rank | |||
Revision as of 00:58, 20 March 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
