Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'Jean-Guillaume Dumas' in GoogleThis author has not been identified. Look up 'Frank Heckenbach' in GoogleThis author has not been identified. Look up 'B. David Saunders' in GoogleThis author has not been identified. Look up 'Volkmar Welker' in Google

runs on WebDSL