Abstract
Recurrence relations are traditionally divided into two classes: A recurrence with “finite history” depends on a fixed number of earlier values,
An equation that depends on all preceding values has a “full history.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Boston
About this chapter
Cite this chapter
(2008). Recurrence Relations. In: Mathematics for the Analysis of Algorithms. Progress in Computer Science and Applied Logic (PCS), vol 1. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4729-2_2
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4729-2_2
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4728-5
Online ISBN: 978-0-8176-4729-2
eBook Packages: Springer Book Archive