Skip to main content
SpringerLink
Log in

The complexity of the sequential choice mechanism

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 134 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. л.А.Щоломов. двухэтапный последователБный выбор по системе отнощений. \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\bar I}\). ПолиномиалБная полнота задачи. Изв. АН СССР. Техническая КиБернетика. No.2 (1981), 72–79. Translated in Engrg. Cybernetics 19 (1981), no 2, 57–65 (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Systems Studies (VNIISI), Moscow, USSR

    L. A. Sholomov

Authors
  1. L. A. Sholomov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sholomov, L.A. (1987). The complexity of the sequential choice mechanism. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation