Probabilistic polynomial time is closed under parity reductions
Open Access
- 31 January 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (2) , 91-94
- https://doi.org/10.1016/0020-0190(91)90140-d
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the computational power of PP and (+)PPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- The difference and truth-table hierarchies for NPRAIRO - Theoretical Informatics and Applications, 1987
- The complexity of combinatorial problems with succinct input representationActa Informatica, 1986
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977