Skip to main content
SpringerLink
Log in

Solution of the problem of coverage by a gradient algorithm

  • 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. A. A. Sapozhenko, “On the complexity of disjunctive normal forms, obtained by means of the gradient algorithm,” in: Discrete Analysis [in Russian], No. 21, Novosibirsk (1972).

  2. É. Sh. Kospanov. “On an algorithm for the construction of sufficiently simple tests,” in: Discrete Analysis [in Russian], No. 8, Novosibirsk (1966).

  3. R. G. Nigmatullin, “On covers of a graph, by branches,” in: Problems of Cybernetics [in Russian], No. 21, Moscow (1969).

Download references

Authors
  1. Yu. O. Chernyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Ya. Nasekin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 85–88, July–August, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chernyshev, Y.O., Nasekin, V.Y. Solution of the problem of coverage by a gradient algorithm. Cybern Syst Anal 12, 584–587 (1976). https://doi.org/10.1007/BF01070394

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation