Skip to main content
SpringerLink
Log in

Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters

  • 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 É. L. Nappel'baum, “Methods of investigation of complex systems. I. The logic of rational choice,” in: Itogi Nauki i Tekhniki, Tekh. Kibern., No. 8 (1977), pp. 5–101.

  2. L. A. Sholomov, “Complexity of the composition representation of choice functions. I. Asymptotic bounds on complexity characteristics,” Kibernetika, No. 2, 5–9 (1984).

    Google Scholar 

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

    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. 4, pp. 10–14, 22, July–August, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sholomov, L.A. Complexity of the composition representation of choice functions. II. Tradeoff between realization parameters. Cybern Syst Anal 20, 477–484 (1984). https://doi.org/10.1007/BF01068919

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation