Immunity and simplicity in relativizations of probabilistic complexity classes
Open Access
- 1 January 1988
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 22 (2) , 227-244
- https://doi.org/10.1051/ita/1988220202271
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Relativizations of Unambiguous and Random Polynomial Time ClassesSIAM Journal on Computing, 1986
- Probabilistic quantifiers, adversaries, and complexity classes : An overviewPublished by Springer Nature ,1986
- Complexity and StructureLecture Notes in Computer Science, 1986
- Simplicity, Relativizations and NondeterminismSIAM Journal on Computing, 1985
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Une généralisation de la notion d'ensemble immuneRevue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1974