Probabilistic quantifiers, adversaries, and complexity classes : An overview
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On relativized exponential and probabilistic complexity classesInformation and Control, 1986
- Probabilistic machines, oracles, and quantifiersPublished by Springer Nature ,1985
- Robustness of probabilistic computational complexity classes under definitional perturbationsInformation and Control, 1982
- Some observations on the probabilistic algorithms and NP-hard problemsInformation Processing Letters, 1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976