"Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms."

Jean-Guillaume Dumas et al. (2003)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2003-07-15

- no documents available
- export record
  dblp key:
  - conf/dagstuhl/DumasHSW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/DumasHSW03
Jean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker:
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. Algebra, Geometry, and Software Systems 2003: 177-206

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.