A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Immunity and simplicity for exact counting and other counting classes”
A note on separating the relativized polynomial time hierarchy by immune sets
Complexity classes between and
J. Castro, C. Seara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Bounded queries to arbitrary sets
A. Lozano (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Nonuniform complexity classes specified by lower and upper bounds
José L. Balcázar, Joaquim Gabarró (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Immunity and simplicity in relativizations of probabilistic complexity classes
José L. Balcázar, David A. Russo (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Combined complexity classes for finite functions
Y. Breitbart, F. D. Lewis (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: