Time and space complexity of deterministic and nondeterministic decision trees

In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finit...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 91; no. 1; pp. 45 - 74
Main Author:	Moshkov, Mikhail
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.02.2023 Springer Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Complex Systems Complexity Computer Science Decision trees Information systems Mathematical analysis Mathematics Nodes Polynomials Problem solving Universe Space complexity Deterministic decision trees Time complexity Nondeterministic decision trees Time-space trade-off Complexity classes
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!