Linked e-resources
Details
Table of Contents
Introduction
Basic Denitions and Notation
Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables
Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables
Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables
Closed Classes of Boolean Functions
Algorithmic Problems
Basic Denitions and Notation
Main Reductions
Functions on Main Diagonal and Below
Local Upper Types of Restricted Sccf-Triples
Bounds Inside Types. .
Basic Denitions and Notation
Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables
Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables
Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables
Closed Classes of Boolean Functions
Algorithmic Problems
Basic Denitions and Notation
Main Reductions
Functions on Main Diagonal and Below
Local Upper Types of Restricted Sccf-Triples
Bounds Inside Types. .