论文信息 - Polynomial Time Algorithms in the Theory of Linear Diophantine Equations - 字舞流文

Polynomial Time Algorithms in the Theory of Linear Diophantine Equations

Michael A. Frumkin | M. Frumkin

[1] A. A. Fridman. Исследования по дискретной оптимизации , 1976 .

[2] G. H. Bradley. Algorithms for Hermite and Smith normal matrices and linear Diophantine equations , 1971 .

[3] Gordon H. Bradley,et al. Algorithm and bound for the greatest common divisor of n integers , 1970, CACM.

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

[5] James Bond. Calculating the General Solution of a Linear Diophantine Equation , 1967 .

[6] I. Borosh,et al. Exact solutions of linear equations with rational coefficients by congruence techniques , 1966 .

[7] W. Blankinship. A New Version of the Euclidean Algorith , 1963 .

[8] C. A. Rogers,et al. An Introduction to the Geometry of Numbers , 1959 .