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:

A note on separating the relativized polynomial time hierarchy by immune sets

Ker-I Ko

RAIRO-Theor. Inf. Appl., 24 3 (1990) 229-240

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1990240302291

This article has been cited by the following article(s):

A uniform approach to define complexity classes

Daniel P. Bovet, Pierluigi Crescenzi and Riccardo Silvestri
Theoretical Computer Science 104 (2) 263 (1992)
DOI: 10.1016/0304-3975(92)90125-Y
See this article

Quantum and classical complexity classes: Separations, collapses, and closure properties

Holger Spakowski, Mayur Thakur and Rahul Tripathi
Information and Computation 200 (1) 1 (2005)
DOI: 10.1016/j.ic.2004.10.009
See this article

Holger Spakowski, Mayur Thakur and Rahul Tripathi
2914 375 (2003)
DOI: 10.1007/978-3-540-24597-1_32
See this article

Worlds to die for

Lane A. Hemaspaandra, Ajit Ramachandran and Marius Zimand
ACM SIGACT News 26 (4) 5 (1995)
DOI: 10.1145/219817.219822
See this article

H. Buhrman and L. Torenvliet
227 (1999)
DOI: 10.1109/CCC.1999.766281
See this article

261 (2005)
DOI: 10.1007/3-540-28520-2_6
See this article

171 (2005)
DOI: 10.1007/3-540-28520-2_5
See this article

361 (2005)
DOI: 10.1007/3-540-28520-2_8
See this article

Strong self-reducibility precludes strong immunity

L. A. Hemaspaandra and M. Zimand
Mathematical Systems Theory 29 (5) 535 (1996)
DOI: 10.1007/BF01184814
See this article

Immunity and Simplicity for Exact Counting and Other Counting Classes

J. Rothe
RAIRO - Theoretical Informatics and Applications 33 (2) 159 (1999)
DOI: 10.1051/ita:1999100
See this article