Immunity and simplicity in relativizations of probabilistic complexity classes
RAIRO-Theor. Inf. Appl., 22 2 (1988) 227-244
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 261 (2005)https://doi.org/10.1007/3-540-28520-2_6
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 171 (2005)https://doi.org/10.1007/3-540-28520-2_5
Complexity Theory and Cryptology
Texts in Theoretical Computer Science An EATCS Series, Complexity Theory and Cryptology 361 (2005)https://doi.org/10.1007/3-540-28520-2_8
Immunity and Simplicity for Exact Counting and Other Counting Classes
J. RotheRAIRO - Theoretical Informatics and Applications 33 (2) 159 (1999)
https://doi.org/10.1051/ita:1999100
STACS 93
Lane A. Hemachandra and Sudhir K. JhaLecture Notes in Computer Science, STACS 93 665 185 (1993)
https://doi.org/10.1007/3-540-56503-5_21
Simultaneous strong separations of probabilistic and unambiguous complexity classes
David Eppstein, Lane A. Hemachandra, James Tisdall and B�lent YenerMathematical Systems Theory 25 (1) 23 (1992)
https://doi.org/10.1007/BF01368782
Logical Foundations of Computer Science — Tver '92
Lane A. Hemachandra, Sanjay Jain and Nikolai K. VereshchaginLecture Notes in Computer Science, Logical Foundations of Computer Science — Tver '92 620 186 (1992)
https://doi.org/10.1007/BFb0023873
A uniform approach to define complexity classes
Daniel P. Bovet, Pierluigi Crescenzi and Riccardo SilvestriTheoretical Computer Science 104 (2) 263 (1992)
https://doi.org/10.1016/0304-3975(92)90125-Y
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Ker-I KoJournal of the ACM 37 (2) 415 (1990)
https://doi.org/10.1145/77600.77623
A result relating disjunctive self-reducibility to P-immunity
Jürgen KämperInformation Processing Letters 33 (5) 239 (1990)
https://doi.org/10.1016/0020-0190(90)90191-Y
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I KoRAIRO - Theoretical Informatics and Applications 24 (3) 229 (1990)
https://doi.org/10.1051/ita/1990240302291
Algorithms and Complexity
David S. JOHNSONAlgorithms and Complexity 67 (1990)
https://doi.org/10.1016/B978-0-444-88071-0.50007-2
Combinatorics, Computing and Complexity
Ker-I KoMathematics and Its Applications, Combinatorics, Computing and Complexity 1 30 (1989)
https://doi.org/10.1007/978-94-009-2411-6_2