29
Logics and Complexity Classes
•
DTrCl = transitive closure on deterministic
graphs (i.e. where
8
x
.
9
·
1
y
.
f
(
x
,
y
)).
•
Theorem
DTrCl+< = LOGSPACE
•
•
ATrCl = alternating transitive closure [ define
in class ]
•
Theorem
ATrCl + < = PTIME