Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique (Q1158946)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique |
scientific article; zbMATH DE number 3744495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique |
scientific article; zbMATH DE number 3744495 |
Statements
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique (English)
0 references
1982
0 references
program synthesis
0 references
algorithms for semirings
0 references
Fibonacci function
0 references
matrix exponentiation algorithm
0 references
transformation technique
0 references
stepwise refinement
0 references
