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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of mathematics and artificial intelligence Ročník 91; číslo 1; s. 45 - 74
Hlavný autor:	Moshkov, Mikhail
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.02.2023 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!