On the Power of Probabilistic Polynomial Time: PNP[log] ⊆ PP
Lane A. Hemachandra; Gerd Wechsung
- On the Power of Probabilistic Polynomial Time: PNP[log] ⊆ PP
Hemachandra, Lane A.
- Technical reports
- Computer Science
- Permanent URL:
- Columbia University Computer Science Technical Reports
- Part Number:
- Department of Computer Science, Columbia University
- Publisher Location:
- New York
- We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial-time truth-table reducible to SAT -- is accepted by a probabilistic polynomialtime Turing machine: PNP[log] ⊆ PP.
- Computer science
- Item views: