| Document Date: 2010-03-30 05:49:30
Open Document File Size: 293,78 KBShare Result on Facebook
City Newark / Grenoble / / Company Ci / H Ker / / Facility Germany University of Delaware / GMP library / / IndustryTerm mathematical software / matrix vector products / probabilistic algorithm / binary search / polynomial time algorithm / inner products / homology / request algorithms / dot product / elimination algorithm / matrix-vector products / The ith chain / valence algorithm / sort algorithm / / Organization Department of Computer and Information Sciences / Mathematisches Institut / University of Delaware / / Person Jean-Guillaume Dumas / Ai / / Product Simplicial Homology / / ProvinceOrState Delaware / / Technology Smith Normal Form algorithm / sort algorithm / request algorithms / polynomial time algorithm / valence algorithm / 2 Algorithm / elimination algorithm / The algorithm / 4 Valence Algorithm / second algorithm / four algorithms / probabilistic algorithm / / URL http /
SocialTag |
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms Jean-Guillaume Dumas1 , Frank Heckenbach2 , David Saunders3 , and Volkmar Welker4 1 2