Results 1  10
of
19
PSelective Sets, and Reducing Search to Decision vs. SelfReducibility
, 1993
"... We obtain several results that distinguish selfreducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6= E, then there exists a set L in NP \Gamma P such that search reduces to decision for L, search does not nonadaptively reduces to de ..."
Abstract

Cited by 40 (10 self)
 Add to MetaCart
We obtain several results that distinguish selfreducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6= E, then there exists a set L in NP \Gamma P such that search reduces to decision for L, search does not nonadaptively reduces to decision for L, and L is not selfreducible. Funding for this research was provided by the National Science Foundation under grant CCR9002292. y Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 z Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260 x Research performed while visiting the Department of Computer Science, State University of New York at Buffalo, Jan. 1992Dec. 1992. Current address: Department of Computer Science, University of ElectroCommunications, Chofushi, Tokyo 182, Japan.  Department of Computer Science, State University of New York at Buffalo, 226...
Inverting Onto Functions
, 1996
"... We look at the hypothesis that all honest onto polynomialtime computable functions have a polynomialtime computable inverse. We show this hypothesis equivalent to several other complexity conjectures including ffl In polynomial time, one can find accepting paths of nondeterministic polynomialtim ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
(Show Context)
We look at the hypothesis that all honest onto polynomialtime computable functions have a polynomialtime computable inverse. We show this hypothesis equivalent to several other complexity conjectures including ffl In polynomial time, one can find accepting paths of nondeterministic polynomialtime Turing machines that accept \Sigma . ffl Every total multivalued nondeterministic function has a polynomialtime computable refinement. ffl In polynomial time, one can compute satisfying assignments for any polynomialtime computable set of satisfiable formulae. ffl In polynomial time, one can convert the accepting computations of any nondeterministic Turing machine that accepts SAT to satisfying assignments. We compare these hypotheses with several other important complexity statements. We also examine the complexity of these statements where we only require a single bit instead of the entire inverse. 1 Introduction Understanding the power of nondeterminism has been one of the pri...
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
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,
Pselective Selfreducible sets: A New Characterization of P
 In Proceedings of the 8th Structure in Complexity Theory Conference
, 1996
"... We show that any pselective and selfreducible set is in P . As the converse is also true, we obtain a new characterization of the class P . A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions autoreducibi ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
(Show Context)
We show that any pselective and selfreducible set is in P . As the converse is also true, we obtain a new characterization of the class P . A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions autoreducibility and selfreducibility differ on NP , and that there are nonpT mitotic sets in NP . 1 Introduction Separating complexity classes is a very popular, but rarely won game in complexity theory. Frustrated by misfortune, computer scientists have often turned to attempts of characterizing complexity classes in a different way. The hopes are, that the new characterization of the complexity class may provide new insights and a `handle' to force the separation where earlier attempts have failed. Wellknown examples of this are the many ways to define the class of sets for which there exist small circuits [Pip79], and the identification of various forms of interactive proof systems with stan...
Separability and Oneway Functions
, 2000
"... We settle all relativized questions of the relationships between the following ve propositions: P = NP P = UP P = NP \ coNP All disjoint pairs of NP sets are Pseparable. ..."
Abstract

Cited by 27 (12 self)
 Add to MetaCart
We settle all relativized questions of the relationships between the following ve propositions: P = NP P = UP P = NP \ coNP All disjoint pairs of NP sets are Pseparable.
Easy sets and hard certificate schemes
 Acta Informatica
, 1997
"... Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for al ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for all NP certificate schemes, infinitely often have easy acceptance certificates. In particular, we provide equivalent characterizations of these classes in terms of relative generalized Kolmogorov complexity, showing that they are robust. We also provide structural conditions—regarding immunity and class collapses—that put upper and lower bounds on the sizes of these two classes. Finally, we provide negative results showing that some of our positive claims are optimal with regard to being relativizable. Our negative results are proven using a novel observation: we show that the classical “wide spacing ” oracle construction technique yields instant nonbiimmunity results. Furthermore, we establish a result that improves upon Baker, Gill, and Solovay’s classical result that NP = P = NP ∩ coNP holds in some relativized world.
Search versus Decision for Election Manipulation Problems
, 2013
"... Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for man ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
(Show Context)
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.
High Sets for NP
 In Advances in Algorithms, Languages, and Complexity
, 1997
"... this paper is a proof that NPhard ..."
(Show Context)
On Quasilinear Time Complexity Theory
, 1994
"... This paper furthers the study of quasilinear time complexity initiated by Schnorr and Gurevich and Shelah. We show that the fundamental properties of the polynomialtime hierarchy carry over to the quasilineartime hierarchy. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper furthers the study of quasilinear time complexity initiated by Schnorr and Gurevich and Shelah. We show that the fundamental properties of the polynomialtime hierarchy carry over to the quasilineartime hierarchy.
FaultTolerance and Complexity
, 1993
"... Robust computationa radical approach to faulttolerant database accesswas explicitly defined one decade ago, and in the following year this notion was presented at ICALP in Antwerp. A decade's study of robust computation by many researchers has determined which problems can be faulttole ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Robust computationa radical approach to faulttolerant database accesswas explicitly defined one decade ago, and in the following year this notion was presented at ICALP in Antwerp. A decade's study of robust computation by many researchers has determined which problems can be faulttolerantly solved via access to databases of many strengths. This paper surveys these results and mentions some interesting unresolved issues.