Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-3
|
Results: 3
POLYTIME MODEL CHECKING FOR TIMED PROBABILISTIC COMPUTATION TREE LOGIC
Authors:
BEAUQUIER D SLISSENKO A
Citation:
D. Beauquier et A. Slissenko, POLYTIME MODEL CHECKING FOR TIMED PROBABILISTIC COMPUTATION TREE LOGIC, Acta informatica, 35(8), 1998, pp. 645-664
ON THE COMPLEXITY OF PARTIALLY OBSERVED MARKOV DECISION-PROCESSES
Authors:
BURAGO D DEROUGEMONT M SLISSENKO A
Citation:
D. Burago et al., ON THE COMPLEXITY OF PARTIALLY OBSERVED MARKOV DECISION-PROCESSES, Theoretical computer science, 157(2), 1996, pp. 161-183
ALGORITHMIC COMPLEXITY OF ALGEBRAIC AND GEOMETRIC-MODELS - PREFACE
Authors:
SLISSENKO A
Citation:
A. Slissenko, ALGORITHMIC COMPLEXITY OF ALGEBRAIC AND GEOMETRIC-MODELS - PREFACE, Theoretical computer science, 157(1), 1996, pp. 1-1
Risultati:
1-3
|