Abstract
In the study of algorithm complexity, we often need to solve linear functional equations. In this lesson, we show how continuous mathematics can help in solving such equations.
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nguyen, H.T., Kreinovich, V. (1997). Solving General Linear Functional Equations: an Application to Algorithm Complexity. In: Applications of Continuous Mathematics to Computer Science. Theory and Decision Library, vol 38. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0743-5_2
Download citation
DOI: https://doi.org/10.1007/978-94-017-0743-5_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4901-8
Online ISBN: 978-94-017-0743-5
eBook Packages: Springer Book Archive