Skip to main content
SpringerLink
Log in

Method of constructing a series of additively different numbers

  • Published:
Cybernetics Aims and scope

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. I. S. Sulkhanishvili, Questions in the Synthesis of Automata from Logical Elements with Delays [in Russian], Izd. IK AN USSR, Kiev (1963).

    Google Scholar 

  2. V. V. Vasil'ev, G. S. Aloyan, A. G. Dodonov, and A. G. Timoshenko, “Model of a network graph for solving the travelling salesman problem,” Author's Certificate 227716, Bulletin of Disclosures, Patents, Industrial Models, and Trademarks [in Russian], No.30 (1968).

Download references

Authors
  1. G. S. Aloyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Timoshenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 12–16, November–December, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aloyan, G.S., Timoshenko, A.G. Method of constructing a series of additively different numbers. Cybern Syst Anal 5, 719–724 (1969). https://doi.org/10.1007/BF01094063

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation