Results 11  20
of
32
Onesided Versus Twosided Randomness
 In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science
, 1998
"... We demonstrate how to use Lautemann's proof that BPP is in \Sigma p 2 to exhibit that BPP is in RP PromiseRP . Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simplifies the proofs of the later result due to Andr ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We demonstrate how to use Lautemann's proof that BPP is in \Sigma p 2 to exhibit that BPP is in RP PromiseRP . Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simplifies the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolimand Trevisan question whether the promise is necessary for the above results, i.e. whether BPP ` RP RP for instance. We give a relativized world where P = RP 6= BPP and thus the promise is indeed needed. 1 Introduction Andreev, Clementi and Rolim [ACR98] show how given access to a quick hitting set generator, one can approximate the size of easily describable sets. As an immediate consequence one gets that if quick hitting set generators exist then P = BPP. Andreev, Clementi, Rolim and Trevisan [ACRT97] simplify the proof and apply the result to simulating BPP with weak random sources. Much earlier, Lautema...
Onesided Versus Twosided Error in Probabilistic Computation
, 1999
"... We demonstrate how to use Lautemann's proof that BPP is in \Sigma p 2 to exhibit that BPP is in RP PromiseRP . Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpliøes the proofs of the later result due to Andreev, ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We demonstrate how to use Lautemann's proof that BPP is in \Sigma p 2 to exhibit that BPP is in RP PromiseRP . Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpliøes the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question whether the promise is necessary for the above results, i.e., whether BPP ` RP RP for instance. We give a relativized world where P = RP 6= BPP and thus the promise is indeed needed.
The Isomorphism Conjecture Holds and Oneway Functions Exist Relative to an Oracle
 Journal of Computer and System Sciences
, 1994
"... In this paper we demonstrate an oracle relative to which there are oneway functions but every paddable 1lidegree collapses to an isomorphism type, thus yielding a relativized failure of the JosephYoung Conjecture (JYC) [JY85]. We then use this result to construct an oracle relative to which t ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
In this paper we demonstrate an oracle relative to which there are oneway functions but every paddable 1lidegree collapses to an isomorphism type, thus yielding a relativized failure of the JosephYoung Conjecture (JYC) [JY85]. We then use this result to construct an oracle relative to which the Isomorphism Conjecture (IC) is true but oneway functions exist, which answers an open question of Fenner, Fortnow, and Kurtz [FFK92]. Thus, there are now relativizations realizing every one of the four possible states of affairs between the IC and the existence of oneway functions. 1 Introduction Berman and Hartmanis [BH76, BH77] showed that if two languages A and B are equivalent to one another under polynomialtime manytoone reductions and if they are both paddable then they are polynomialtime isomorphic. After surveying all of the thenknown NPcomplete languages and discovering that each was indeed paddable, they posed: The Isomorphism Conjecture (IC) Every NPcomplete lan...
A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes
, 1994
"... We present a method to prove oracle theorems of the following type. ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We present a method to prove oracle theorems of the following type.
Equivalences and separations between quantum and classical learnability
 SIAM J. Comput
, 2004
"... Abstract. We consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact learning from membership queries and Valiant’s Probably Approximately Correct (PAC) model of learning from random examples. For each of these two learning models we establish a p ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact learning from membership queries and Valiant’s Probably Approximately Correct (PAC) model of learning from random examples. For each of these two learning models we establish a polynomial relationship between the number of quantum versus classical queries required for learning. These results contrast known results which show that testing blackbox functions for various properties, as opposed to learning, can require exponentially more classical queries than quantum queries. We also show that under a widely held computational hardness assumption (the intractability of factoring Blum integers) there is a class of Boolean functions which is polynomialtime learnable in the quantum version but not the classical version of each learning model. For the model of exact learning from membership queries, we establish a stronger separation by showing that if any oneway function exists, then there is a class of functions which is polynomialtime learnable in the quantum setting but not in the classical setting. Thus, while quantum and classical learning are equally powerful from an information theory perspective, the models are different when viewed from a computational complexity perspective.
The npcompleteness column: Finding needles in haystacks
 ACM Transactions on Algorithms
, 2007
"... Abstract. This is the 26th edition of a column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NPCompleteness, ” W. H. Freeman & Co., New York, 1979, h ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. This is the 26th edition of a column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NPCompleteness, ” W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J]. ” Previous columns, the first 23 of which appeared in J. Algorithms, will be referred to by a combination of their sequence number and year of appearance, e.g., “Column 1 [1981]. ” Full bibliographic details on the previous columns, as well as downloadable unofficial versions of them, can be found at
Lower bounds for quantum search and derandomization
, 1998
"... We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In particular, if T ∈ O ( √ N) then the error is lower bounded by a constant. If we want error ≤ 1/2 N then we need T ∈ Ω(N) q ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In particular, if T ∈ O ( √ N) then the error is lower bounded by a constant. If we want error ≤ 1/2 N then we need T ∈ Ω(N) queries. We apply this to show that a quantum computer cannot do much better than a classical computer when amplifying the success probability of an RPmachine. A classical computer can achieve error ≤ 1/2 k using k applications of the RPmachine, a quantum computer still needs at least ck applications for this (when treating the machine as a blackbox), where c> 0 is a constant independent of k. Furthermore, we prove a lower bound of Ω ( √ log N / loglog N) queries for quantum boundederror search of an ordered list of N items. 1
A Tight Relationship between Generic Oracles and Type2 Complexity Theory
, 1997
"... We show that any two complexity classes satisfying some general conditions are distinct relative to a generic oracle iff the corresponding type2 classes are distinct. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We show that any two complexity classes satisfying some general conditions are distinct relative to a generic oracle iff the corresponding type2 classes are distinct.
Two Oracles that Force a Big Crunch
, 1999
"... The central theme of this paper is the construction of an oracle A such that NEXP A = P NP A . The construction of this oracle answers a long standing open question rst posed by Heller, and unsuccessfully attacked many times since. For the rst construction of the oracle, we present a new ty ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The central theme of this paper is the construction of an oracle A such that NEXP A = P NP A . The construction of this oracle answers a long standing open question rst posed by Heller, and unsuccessfully attacked many times since. For the rst construction of the oracle, we present a new type of injury argument that we call \resource bounded injury." In the special case of the construction of this oracle, a tree method can be used to transform unbounded search into exponentially bounded, hence recursive, search. This transformation of the construction can be interleaved with another construction so that relative to the new combined oracle also P = UP = NP\coNP. This leads to the curious situation where LOW(NP) = P, but LOW(P NP ) = NEXP, and the complete p m degree for P NP collapses to a single pisomorphism type. 1 Introduction In 1978, Seiferas, Fischer and Meyer [SFM78] showed a very strong separation theorem for nondeterministic time: For time constru...
Strong SelfReducibility Precludes Strong Immunity
, 1995
"... Do selfreducible sets inherently lack immunity from deterministic polynomial time? Though this is unlikely to be true in general, in this paper we prove that sufficiently strong selfreducibility precludes sufficiently strong immunity from deterministic polynomial time. In particular, we prove that ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Do selfreducible sets inherently lack immunity from deterministic polynomial time? Though this is unlikely to be true in general, in this paper we prove that sufficiently strong selfreducibility precludes sufficiently strong immunity from deterministic polynomial time. In particular, we prove that NT is not P balanced immune. However, we prove that NT, a class whose sets have very strong selfreducibility properties, is P biimmune relative to a generic oracle. Thus, the previous result cannot be relativizably extended to biimmunity. We also prove that NP and \PhiP are both P balanced immune relative to a random oracle; the former provides the strongest known relativized separation of NP from P. 1 Introduction Relativization results have a long but increasingly checkered history. Today, there are conflicting views as to the extent to which relativization results give insight into the structure of feasible computation [HCRR90,All90,HCC + 92,For94], even as oracle construction has ...