Results 1  10
of
1,481,164
Graded SelfReducibility
, 1998
"... We introduce two special kinds of selfreducible sets that we call timegraded and spacegraded languages. Attaching time and space bounds to them yields a uniform, quantitative definition of resourcebounded selfreducibility that applies to all languages. We apply this to study the relationship be ..."
Abstract
 Add to MetaCart
We introduce two special kinds of selfreducible sets that we call timegraded and spacegraded languages. Attaching time and space bounds to them yields a uniform, quantitative definition of resourcebounded selfreducibility that applies to all languages. We apply this to study the relationship
New Surprises from SelfReducibility
"... Abstract. Selfreducibility continues to give us new angles on attacking some of the fundamental questions about computation and complexity. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Selfreducibility continues to give us new angles on attacking some of the fundamental questions about computation and complexity. 1
On the RandomSelfReducibility . . .
 SIAM JOURNAL ON COMPUTING
, 1993
"... In this paper, we generalize the previous formal definitions of randomselfreducibility. We show that, even under our very general definition, sets that are complete for any level of the polynomial hierarchy are not nonadaptively randomselfreducible, unless the hierarchy collapses. In particular ..."
Abstract
 Add to MetaCart
In this paper, we generalize the previous formal definitions of randomselfreducibility. We show that, even under our very general definition, sets that are complete for any level of the polynomial hierarchy are not nonadaptively randomselfreducible, unless the hierarchy collapses
On SelfReducible Sets of Low Information Content
, 1994
"... Selfreducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this selfreducibility structure of a set can be used to access easil ..."
Abstract
 Add to MetaCart
Selfreducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this selfreducibility structure of a set can be used to access
Combining SelfReducibility and Partial Information Algorithms
"... Abstract. A partial information algorithm for a language A computes, for some fixed m, for input words x1,..., xm a set of bitstrings containing χA(x1,..., xm). E.g., pselective, approximable, and easily countable languages are defined by the existence of polynomialtime partial information algorit ..."
Abstract
 Add to MetaCart
algorithms of specific type. Selfreducible languages, for different types of selfreductions, form subclasses of PSPACE. For a selfreducible language A, the existence of a partial information algorithm sometimes helps to place A into some subclass of PSPACE. The most prominent known result in this respect
RandomSelfReducibility
, 2004
"... We consider ArthurMerlin proof systems where (a) Arthur is a probabilistic quasipolynomial time Turing machine, denoted AMqpoly, and (b) Arthur is a probabilistic exponential time Turing machine, denoted AMexp. We prove two new results related to these classes. We show that if coNP is in AMqpoly ..."
Abstract
 Add to MetaCart
NP is in AMqpoly then the exponential hierarchy collapses to AMexp. We show that if SAT is polylogarithmic round adaptive randomselfreducible, then SAT is in AMqpoly with a polynomial advice. The first result improves a recent result of Selman and Sengupta (2004) who showed that the hypothesis collapses
Selectivity and SelfReducibility: New Characterizations of Complexity Classes
 Special Issue: Proceedings of the 6th International Conference on Computing and Information
, 1994
"... It is known that a set is in P iff it is ptime Turing selfreducible and pselective [2] and a ptime Turing selfreducible set is in NP " coNP iff it is NPselective [4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result of ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
It is known that a set is in P iff it is ptime Turing selfreducible and pselective [2] and a ptime Turing selfreducible set is in NP " coNP iff it is NPselective [4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result
RandomSelfReducibility In The Polynomial Hierarchy
"... In this paper, we define the concept of randomselfreducibility and provide intuitive motivation for the definition. We then introduce the concept of polynomial advice, and use it to prove the central result due to Feigenbaum and Fortnow: If some NPcomplete language is randomselfreducible, then ..."
Abstract
 Add to MetaCart
In this paper, we define the concept of randomselfreducibility and provide intuitive motivation for the definition. We then introduce the concept of polynomial advice, and use it to prove the central result due to Feigenbaum and Fortnow: If some NPcomplete language is randomselfreducible
Planar graph coloring is not selfreducible, assuming
 P �= NP. Theoretical Computer Science
, 1991
"... We show that obtaining the lexicographically first four coloring of a planar graph is NP –hard. This shows that planar graph fourcoloring is not selfreducible, assuming P ̸= NP. One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of fou ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We show that obtaining the lexicographically first four coloring of a planar graph is NP –hard. This shows that planar graph fourcoloring is not selfreducible, assuming P ̸= NP. One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number
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 (4 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
Results 1  10
of
1,481,164