Skip to main content
Log in

Finding successive minima of an integral lattice and a vector lattice, close to a given one

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. J. Cassels, Rational Quadratic Forms [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  2. M. Gery and D. Johnson, Computing Machines and Hard to Solve Problems [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  3. H. W. Lenstra, “Integer programming a fixed number of variables,” Math. Oper. Res.,8, No. 4, 538–548 (1983).

    Google Scholar 

  4. V. N. Shevchenko, “Algebraic approach to integer programming,” Kibernetika, No. 4, 36–41 (1984).

    Google Scholar 

  5. G. E. Shilov, Mathematical Analysis (Finite-Dimensional Linear Spaces) [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  6. V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Computations [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  7. F. R. Gantmakher, Theory of Matrices [in Russian], Nauka, Moscow (1966).

    Google Scholar 

  8. D. Knuth, The Art of Computer Programming. Seminumerical Algorithms, Vol. 2, Addison-Wesley, Reading, MA (1969).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 4, pp. 46–49, July–August, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chirkov, A.Y., Shevchenko, V.N. Finding successive minima of an integral lattice and a vector lattice, close to a given one. Cybern Syst Anal 23, 492–497 (1987). https://doi.org/10.1007/BF01078906

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01078906

Keywords

Navigation