Introduction

This book is devoted to the study of deterministic and nondeterministic computation trees. Computation trees are a natural generalization of decision trees: in addition to the one-place predicate-type operations (attributes) used in decision trees, computation trees can use multi-place predicate and function operations.

They arise both where we deal with algorithms for solving problems of combinatorial optimization, computational geometry, etc., and where we solve classification or prediction problems, especially if we use combinations of input variables as attributes.

Scope and Focus

This book mainly studies the complexity of computation trees and also examines related optimization problems. The results discussed in this book may be useful to researchers studying algorithms and using algorithm models similar to computation trees.

These results may also be useful to researchers working with decision trees and decision rule systems in data analysis, particularly, in rough set theory, logical analysis of data, and test theory.

Applications

The book is also used to create graduate courses.