86
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

How can we solve a linear Diophantine equation by the basis reduction algorithm

Pages 1227-1234 | Published online: 19 Aug 2006

References

  • Lehmer , D. H. 1938 . American Mathematical Monthly , 45 : 227 – 233 .
  • Knuth , D. E. 1969 . The Art of Computing Programming, Vol 2, Seminumerical Algorithms , Addison-Wesley .
  • Schönhage , A. 1971 . Acta Informatica , 1 : 133 – 144 .
  • Esmaeili , H. and Mahdavi-Amiri , N. 2002 . Farhang va Andishe-ye Riyāzi, , 21 : 1 – 25 .
  • Chon , T. J. and Collins , G. E. 1982 . SIAM Journal of Computation , 11 : 687 – 708 .
  • McClellan , M. T. 1973 . Journal of Association Computation Machinery , 20 : 563 – 588 .
  • Lenstra , A. K. , Lenstra , H. W. and Lovǎsz , L. 1982 . Mathematische Annealen , 261 : 515 – 534 .
  • Nemhauser , G. L. and Wolsey , L. 1999 . Integer and Combinatorial Optimization , John Wiley and Sons .
  • Hlawka , E. , Schoißengeier , J. and Taschner , R. 1991 . Geometric and Analytic Number Theory , Springer-Verlag .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.