Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms

Jean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker. Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. In Michael Joswig, Nobuki Takayama, editors, Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar]. pages 177-206, Springer, 2003.

Abstract

Abstract is missing.