We show that if a complexity class C is closed downward under polynomialtime majority truth-table reductions ( p mtt ), then practically every other "polynomial" closure property it enjoys is inherited by the corresponding bounded 2-sided error class BP[C]. For instance, the Arthur-Merlin game class AM [Bab85] enjoys practically every closure property of NP. Our main lemma shows that for any relativizable class D which meets two fairly transparent technical conditions, we have D BP[C] ` BP[D C ]. Among our applications, we simplify the proof by S. Toda [Tod89, Tod91] that the polynomial hierarchy PH is contained in BP[ \Phi P]. We also show that relative to a random oracle R, PH R is properly contained in \Phi P R . Keyw...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial...
AbstractIt is shown that the assumption of NP having polynomial-size circuits implies (apart from a ...
An oracle X is constructed such that the exponential complexity class ΔEP,X2 equals the probabilisti...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
htmlabstractMany models in theoretical computer science allow for computations or representations wh...
We use derandomization to show that sequences of positive pspace-dimension -- in fact, even positive...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Ou...
The complexity class BPP (defined by Gill) contains problems that can be solved in polynomial time w...
We prove several results which, together with prior work, provide a nearly-complete picture of the r...
Unambiguous computation according to UP has become a classical notion in computational complexity th...
Theoretical computer scientists have been debating the role of oracles since the 1970's. This p...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial...
AbstractIt is shown that the assumption of NP having polynomial-size circuits implies (apart from a ...
An oracle X is constructed such that the exponential complexity class ΔEP,X2 equals the probabilisti...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
htmlabstractMany models in theoretical computer science allow for computations or representations wh...
We use derandomization to show that sequences of positive pspace-dimension -- in fact, even positive...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Ou...
The complexity class BPP (defined by Gill) contains problems that can be solved in polynomial time w...
We prove several results which, together with prior work, provide a nearly-complete picture of the r...
Unambiguous computation according to UP has become a classical notion in computational complexity th...
Theoretical computer scientists have been debating the role of oracles since the 1970's. This p...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
Add to ORKG