Abstract
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high computational costs. In this paper, we propose a general strategy, in order to reduce the complexity in some important formulas (those following a specific pattern) obtained by this algorithm. Then, we show two examples of application of this methodology. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Berciano, A., Jiménez, M. J., & Real, P. (2006). Reducing computational costs in the basic perturbation lemma. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4194 LNCS, pp. 33–48). Springer Verlag. https://doi.org/10.1007/11870814_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
