Sciweavers

Share
MFCS
2005
Springer

Combining Self-reducibility and Partial Information Algorithms

12 years 3 months ago
Combining Self-reducibility and Partial Information Algorithms
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., p-selective, approximable, and easily countable languages are defined by the existence of polynomial-time partial information algorithms of specific type. Self-reducible languages, for different types of self-reductions, form subclasses of PSPACE. For a self-reducible 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 is: P-selective languages which are self-reducible are in P [9]. Closely related is the fact that the existence of a partial information algorithm for A simplifies the type of reductions or self-reductions to A. The most prominent known result in this respect is: Turing reductions to easily countable languages simplify to truth-table reductions [8]. We prove new results of this type. We show...
André Hernich, Arfst Nickelsen
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where MFCS
Authors André Hernich, Arfst Nickelsen
Comments (0)
books