On the Worst-case Complexity

First Page		Document Content
Date: 2000-02-10 02:35:36 Numerical linear algebra Matrix theory Matrices Computational complexity theory Gaussian elimination Hermite normal form Matrix Smith normal form Triangular matrix Algebra Mathematics Linear algebra		On the Worst-case Complexity Add to Reading List Source URL: itee.uq.edu.au Download Document from Source Website File Size: 532,57 KB Share Document on Facebook

	Computing Persistent Homology ∗ Afra Zomorodian DocID: 1amDX - View Document
	PDF Document DocID: miW6 - View Document
	Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms Jean-Guillaume Dumas1 , Frank Heckenbach2 , David Saunders3 , and Volkmar Welker4 1 2 DocID: 9IjY - View Document
	The Smith Normal Form of a Matrix Patrick J. Morandi February 17, 2005 In this note we will discuss the structure theorem for finitely generated modules over a principal ideal domain from the point of view of matrices. W DocID: 8J8N - View Document
	(C[removed]Society for Industrial and Applied Mathematics SIAM J. COMPUT. DocID: 50fO - View Document