Skip to main content
SpringerLink
Log in

A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A linear-time algorithm is proposed for determining the distances of the points of a given set in an r-dimensional integral lattice from its complement.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. D. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Mir, Moscow (1978).

    Google Scholar 

Download references

Authors
  1. A. V. Karzanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 177–181, March–April, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karzanov, A.V. A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement. Cybern Syst Anal 28, 316–319 (1992). https://doi.org/10.1007/BF01126221

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation