Coreduction Homology Algorithm

This paper presents a new reduction algorithm for the efficient computation of the homology of cubical sets and polotypes. The algorithm-particularly strong for low-dimensional sets embedded in high dimensions-runs in linear time. The paper presents the theoretical background of the algorithm, the algorithm itself, experimental results based on an implementation for cubical sets as well as some theoretical complexity estimates.