Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO. Theoretical Informatics and Applications
  • Volume 30 (1996)
  • no. 2

Volume 30 (1996) no. 2

Table of contents


Preface
ITA
p. 89-90

Bounded queries to arbitrary sets
Lozano, A.
p. 91-100

Complexity classes between Θ k P and Δ 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
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of