Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique

DOI10.1007/BF00264438zbMath0474.68008OpenAlexW1964937498MaRDI QIDQ1158946

Rod M. Burstall, Alberto Pettorossi

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264438

zbMATH Keywords

stepwise refinementprogram synthesistransformation techniqueFibonacci functionalgorithms for semiringsmatrix exponentiation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Semirings (16Y60) General topics in the theory of software (68N01)

Related Items (3)

Unnamed Item ⋮ 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 ⋮ How powerful are folding/unfolding transformations?

This page was built for publication: Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique