Skip to main content
SpringerLink
Log in

Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics

  • 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. S. V. Emel'yanov and E. L. Nappel'baum, “Methods of investigation of complex systems. I. Logic of rational choice,” Itogi Nauki i Tekhniki, Ser. Tekh. Kibernetika,8, 5–101 (1977).

    Google Scholar 

  2. S. V. Yablonskii, Introduction to Discrete Mathematics [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  3. A. G. Kurosh, Lectures on General Algebra [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  4. L. A. Sholomov, “Logical methods in problems of compatible choice,” Moscow (1978), (preprint/VNIISI; No. 13-78).

  5. L. A. Sholomov, “Application of logical methods to problems of sequential choice,” Moscow (1980) (preprint/VNIISI; No. 25-80).

  6. D. Kleitmen, “Dedekind's problem; number of Boolean monotone functions,” Kibern. Sb., Nov. Ser., No. 7, 43–52 (1970).

    Google Scholar 

Download references

Authors
  1. L. A. Sholomov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 5–9, 13, March–April, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sholomov, L.A. Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics. Cybern Syst Anal 20, 172–179 (1984). https://doi.org/10.1007/BF01069171

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation