RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 2

Sommaire

Preface

ITA

p. 89-90

Bounded queries to arbitrary sets

Lozano, A.

p. 91-100

Complexity classes between

Θ_{k}^{P}

Δ_{k}^{P}

Castro, J. ; Seara, C.

p. 101-121

On the robustness of ALMOST-

ℛ

Book, Ronald V. ; Mayordomo, Elvira

p. 123-133

On sets bounded truth-table reducible to

P

-selective sets

Thierauf, Thomas ; Toda, Seinosuke ; Watanabe, Osamu

p. 135-154

Monotonous and randomized reductions to sparse sets

Arvind, V. ; Köbler, J. ; Mundhenk, M.

p. 155-179