Artículo
Algorithms in Algebraic Topology and Homological Algebra: Problem of Complexity
Autor/es | Real Jurado, Pedro
Álvarez Solano, Víctor Armario Sampalo, José Andrés González Díaz, Rocío |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2002 |
Fecha de depósito | 2021-06-28 |
Publicado en |
|
Resumen | This 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 ... This 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. |
Cita | Real 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Algorithms in algebraic topology ... | 391.3Kb | [PDF] | Ver/ | |