Results 1  10
of
17
The complexity of decision versus search
 SIAM Journal on Computing
, 1994
"... A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and nondeterministic doubleexponential time are unequal) we construct a language in NP for which search does not red ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
(Show Context)
A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and nondeterministic doubleexponential time are unequal) we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions we present languages in NP for which it is harder to prove membership interactively than it is to decide this membership, and languages in NP which are not checkable. Keywords: NPcompleteness, selfreducibility, interactive proofs, program checking, sparse sets,
Languages that are Easier than their Proofs
, 1991
"... A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and nondeterministic doubleexponential time are unequal) we construct a language in NP for which search does not reduc ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and nondeterministic doubleexponential time are unequal) we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions we present languages in NP for which it is harder to prove membership interactively than it is to decide this membership. Similarly we present languages where checking is harder than computing membership. Each of the following properties  checkability, randomselfreducibility, reduction from search to decision, and interactive proofs in which the prover's power is limited to deciding membership in the language itself  implies coherence, one of the weakest forms of selfreducibility. Under assumptions about tripleexponential time, we construct incoherent sets in NP....
Upward Separation for FewP and Related Classes
, 1994
"... This paper studies the range of application of the upward separation technique that has been introduced by Hartmanis to relate certain structural properties of polynomialtime complexity classes to their exponentialtime analogs and was first applied to NP [Har83]. Later work revealed the limitation ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
This paper studies the range of application of the upward separation technique that has been introduced by Hartmanis to relate certain structural properties of polynomialtime complexity classes to their exponentialtime analogs and was first applied to NP [Har83]. Later work revealed the limitations of the technique and identified classes defying upward separation. In particular, it is known that coNP as well as certain promise classes such as BPP, R, and ZPP do not possess upward separation in all relativized worlds [HIS85; HJ93], and it had been suspected that this was also the case for other promise classes such as UP and FewP [All91]. In this paper, we refute this conjecture by proving that, in particular, FewP does display upward separation, thus providing the first upward separation result for a promise class. In fact, this follows from a more general result the proof of which heavily draws on Buhrman, Longpr'e, and Spaan's recently discovered tally encoding of sparse sets. As ...
On the limitations of locally robust positive reductions
 International Journal of Foundations of Computer Science
, 1991
"... Polynomialtime positive reductions, as introduced by Selman, are by definition globally robust — they are positive with respect to all oracles. This paper studies the extent to which the theory of positive reductions remains intact when their global robustness assumption is removed. We note that tw ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Polynomialtime positive reductions, as introduced by Selman, are by definition globally robust — they are positive with respect to all oracles. This paper studies the extent to which the theory of positive reductions remains intact when their global robustness assumption is removed. We note that twosided locally robust positive reductions — reductions that are positive with respect to the oracle to which the reduction is made — are sufficient to retain all crucial properties of globally robust positive reductions. In contrast, we prove absolute and relativized results showing that onesided local robustness fails to preserve fundamental properties of positive reductions, such as the downward closure of NP. Keywords: Structural complexity theory; Polynomialtime reductions; Complexity classes.
Translating equality downwards
, 1998
"... Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of some other pair of complexity classes that (a priori) one expects are smaller. Recently, the first downward translation of equality was obtained that applied to the polynom ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of some other pair of complexity classes that (a priori) one expects are smaller. Recently, the first downward translation of equality was obtained that applied to the polynomial hierarchy—in particular, to bounded access to its levels [HHH97]. In this paper, we provide a much broader downward translation that extends not only that downward translation but also that translation’s elegant enhancement by Buhrman and Fortnow [BF96]. Our work also sheds light on previous research on the structure of refined polynomial hierarchies [Sel95, Sel94], and strengthens the connection between the collapse of bounded query hierarchies and the collapse of the polynomial hierarchy.
SpaceEfficient Recognition Of Sparse SelfReducible Languages
, 1994
"... . Mahaney and others have shown that sparse selfreducible sets have timeecient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of co ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
. Mahaney and others have shown that sparse selfreducible sets have timeecient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of complete sets for feasible classes until now. This paper shows that sparse selfreducible sets have spaceecient algorithms, and in many cases, even have timespaceecient algorithms. We conclude that NL, NC k , AC k , LOG(DCFL), LOG(CFL), and P lack complete (or even Turinghard) sets of low density unless implausible complexity class inclusions hold. In particular, if NL (respectively P, k , or NP) has a polylogsparse logspacehard set, then NL SC (respectively P SC, k SC, or PH SC), and if P has subpolynomially sparse logspacehard sets, then P 6= PSPACE. Subject classications. 68Q15, 03D15. 1. Introduction Complete sets are the quintessences of their complexity cla...
A Moment of Perfect Clarity I: The Parallel Census Technique
, 2000
"... We discuss the history and uses of the parallel census techniquean elegant tool in the study of certain computational objects having polynomially bounded census functions. A sequel [GH] will discuss advances (including [CNS95] and Glaer [Gla00]), some related to the parallel census technique and ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We discuss the history and uses of the parallel census techniquean elegant tool in the study of certain computational objects having polynomially bounded census functions. A sequel [GH] will discuss advances (including [CNS95] and Glaer [Gla00]), some related to the parallel census technique and some due to other approaches, in the complexityclass collapses that follow if NP has sparse hard sets under reductions weaker than (full) truthtable reductions.
Upward Separations and Weaker Hypotheses in ResourceBounded Measure
"... We consider resourcebounded measure in doubleexponentialtime complexity classes. In contrast to complexity class separation translating downwards, we show that measure separation translates upwards. For example, µp(NP) ̸ = 0 ⇒ µe(NE) ̸ = 0 ⇒ µexp(NEXP) ̸ = 0. We also show that if NE does not have ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider resourcebounded measure in doubleexponentialtime complexity classes. In contrast to complexity class separation translating downwards, we show that measure separation translates upwards. For example, µp(NP) ̸ = 0 ⇒ µe(NE) ̸ = 0 ⇒ µexp(NEXP) ̸ = 0. We also show that if NE does not have emeasure 0, then the NPmachine hypothesis holds. We give oracles relative to which the converses of these statements do not hold. Therefore the hypothesis on the emeasure of NE is relativizably weaker than the ofteninvestigated pmeasure hypothesis on NP, but it has many of the same consequences.
Tally NP Sets and Easy Census Functions
, 1998
"... We study the question of whether every P set has an easy (i.e., polynomialtime computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as #P 1 ` FP, where #P 1 is the class of functions that count the witnesses for tally NP sets ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study the question of whether every P set has an easy (i.e., polynomialtime computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as #P 1 ` FP, where #P 1 is the class of functions that count the witnesses for tally NP sets. We prove that every #P PH 1 function can be computed in FP #P #P 1 1 . Consequently, every P set has an easy census function if and only if every set in the polynomial hierarchy does. We show that the assumption #P 1 ` FP implies P = BPP and PH ` MOD k P for each k 2, which provides further evidence that not all sets in P have an easy census function. We also relate a set's property of having an easy census function to other wellstudied properties of sets, such as rankability and scalability (the closure of the rankable sets under Pisomorphisms). Finally, we prove that it is no more likely that the census function of any set in P can be approximated (more precisely, can be n ff e...