Algorithm 288: solution of simultaneous linear Diophantine equations [F4]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 288: solution of simultaneous linear Diophantine equations [F4]

Full text

Pdf (126 KB)

Source

Communications of the ACM archive
Volume 9 , Issue 7 (July 1966) table of contents

Page: 514

Year of Publication: 1966

ISSN:0001-0782

Author

W. A. Blankinship

National Security Agency, Ft. Geo. G. Meade, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Citation Count: 3

Additional Information:

cited by

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/365719.365971 What is a DOI?

CITED BY 3

	Stanley Cabay, Exact solution of linear equations, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.392-398, March 23-25, 1971, Los Angeles, California, United States
	Mark Giesbrecht, Efficient parallel solution of sparse systems of linear diophantine equations, Proceedings of the second international symposium on Parallel symbolic computation, p.1-10, July 20-22, 1997, Maui, Hawaii, United States
	Mostafa Khorramizadeh, A note on solving linear Diophantine systems by using L3-reduction algorithm, International Journal of Computer Mathematics, v.86 n.5, p.883-896, May 2009