KIAM Main page Web Library  •  Publication Searh  Русский 

Article collection "Mathematical Problems of Cybernetics" №16, Moscow, 2007
Authors: Moshkov M.Y.
Bounds on complexity and algorithms for construction of deterministic conditional tests
The paper generalized the notion of a testing table for modelling decision trees of problems that may have several solutions, but only one needs to be found. Such problems include, for instance, many discrete optimization problems. We study upper bounds of time complexity and algorithms for constructing deterministic conditional tests of testing tables.
Decision trees, discrete optimization, testing tables, deterministic conditional tests
Publication language: russian,  pages: 46 (p. 79-124)
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
List of publications citation:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Moshkov M.Y.,  ,  KAUST, Saudi Arabia