Searching for "Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
by Jean-Guillaume Dumas, Frank Heckenbach, David Saunders, Volkmar Welker — 2002
…Computing Simplicial Homology Based on Ecient Smith Normal Form Algorithms Jean-Guillaume Dumas 1…
Cited by 10 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB