Title of article
Homology computation by reduction of chain complexes
Author/Authors
T. Kaczy ski، نويسنده , , M. Mrozek، نويسنده , , M. Lusarek، نويسنده ,
Issue Information
هفته نامه با شماره پیاپی سال 1997
Pages
12
From page
59
To page
70
Abstract
A new algorithm for computing the homology module of a finitely generated chain complex is given. It is based on local one-step reductions of the size of the initial chain complex and it has a clear geometrical interpretation. The complexity of the algorithm is discussed in special cases.
Keywords
Chain complex , Homology , Computational complexity , Algorithm
Journal title
Computers and Mathematics with Applications
Serial Year
1997
Journal title
Computers and Mathematics with Applications
Record number
918135
Link To Document