论文信息 - Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix - 字舞流文

Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

Recently, Frumkin [9] pointed out that none of the well-known algorithms that transform an integer matrix into Smith [16] or Hermite [12] normal form is known to be polynomially bounded in its runn...

Ravi Kannan | Achim Bachem | R. Kannan | A. Bachem

[1] Michael A. Frumkin,et al. Polynomial Time Algorithms in the Theory of Linear Diophantine Equations , 1977, FCT.

[2] H. Smith. I. On systems of linear indeterminate equations and congruences , 1862, Proceedings of the Royal Society of London.

[3] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .

[4] Jeremy F. Shapiro,et al. Computational experience with a group theoretic integer programming algorithm , 1973, Math. Program..

[5] Michael Heymann,et al. Transfer Equivalence of Linear Dynamical Systems , 1970 .

[6] G. Nemhauser,et al. Integer Programming , 2020 .

[7] S. Vajda,et al. Integer Programming and Network Flows , 1970 .

[8] C. Hermite. Œuvres de Charles Hermite: Sur l'introduction des variables continues dans la théorie des nombres , 1851 .