Access Restriction

Author Ko, Ker-I
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1990
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The probabilistic polynomial-time hierarchy (BPH) is the hierarchy generated by applying the BP-operator to the Meyer-Stockmeyer polynomial-time hierarchy (PH), where the BP-operator is the natural generalization of the probabilistic complexity class BPP. The similarity and difference between the two hierarchies BPH and PH is investigated. Oracles $\textit{A}$ and $\textit{B}$ are constructed such that both $PH(\textit{A})$ and $PH(\textit{B})$ are infinite while $BPH(\textit{A})$ is not equal to $PH(\textit{A})$ at any level and $BPH(\textit{B})$ is identical to $PH(\textit{B})$ at every level. Similar separating and collapsing results in the case that $PH(\textit{A})$ is finite having exactly $\textit{k}$ levels are also considered.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 37
Issue Number 2
Page Count 24
Starting Page 415
Ending Page 438

Open content in new tab

   Open content in new tab
Source: ACM Digital Library