Homology computation by reduction of chain complexes

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.