2021-06-282021-06-282002Real Jurado, P., Álvarez Solano, V., Armario Sampalo, J.A. y González Díaz, R. (2002). Algorithms in Algebraic Topology and Homological Algebra: Problem of Complexity. Journal of Mathematical Sciences, 108 (6), 1015-1033.1072-3374https://hdl.handle.net/11441/114895This review tackles the problem of the high computational complexity lying in most algorithms in algebraic topology and homological algebra. Three particular algorithms are considered: the computation of the homology of commutative di erential graded algebras, the homology of principal twisted Cartesian products of Eilenberg{MacLane spaces, and a combinatorial method of computing Steenrod squares. Bibliography: 54 titles.application/pdf19engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1023/A:1013544506151