The complexity of the sequential choice mechanism

  • L. A. Sholomov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Partial Order Maximal Increase Choice Function Depth Measure Total Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • L. A. Sholomov
    • 1
  1. 1.Institute for Systems Studies (VNIISI)MoscowUSSR

Personalised recommendations