Skip to main content
SpringerLink
Log in

Typical length of minimal covering for tables with a spectrum

  • 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. O. Gel'fond, “Some combinatorial properties of (0, 1)-matrices,” Mat. Sb.,75, (117), No. 1, 3 (1968).

    Google Scholar 

  2. V. E. Tarakanov, “On the maximum depth for a class of (0, 1)-matrices,” Mat. Sb,75 (117), No. 1, 4–14 (1968).

    Google Scholar 

  3. V. K. Leont'ev, “An upper bound δ on the depth of (0, 1)-matrices,” Mat. Zametki,15, No. 3, 421–429 (1974).

    Google Scholar 

  4. Yu. A. Mamatov, “Asymptotic properties of shortest coverings,” Dokl. Akad. Nauk SSSR,229, No. 4, 801–803 (1976).

    Google Scholar 

  5. Discrete Mathematics and Mathematical Problems of Cybernetics, [in Russian], Nauka, Moscow (1974).

Download references

Authors
  1. V. G. Ustyuzhaninov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 24–27, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ustyuzhaninov, V.G. Typical length of minimal covering for tables with a spectrum. Cybern Syst Anal 16, 658–662 (1980). https://doi.org/10.1007/BF01078494

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation