Computing functions with parallel queries to NP

The class Θ 2 p of languages polynomial-time truth-table reducible to sets in NP has a wide range of different characterizations. We consider several functional versions of Θ 2 p based on these characterizations. We show that in this way the three function classes FLlog NP, FPlog NP, and FP∥ NP are obtained. In contrast to the language case the function classes seem to all be different. We give evidence in support of this fact by showing that FLlog NP coincides with any of the other classes then L = P, and that the equality of the classes FPlog NP and FP∥ NP would imply that the number of nondeterministic bits needed for the computation of any problem in NP can be reduced by a polylogarithmic factor, and that the problem can be computed deterministically with a subexponential time bound of order 2 n O(1/log log n).

Authors

• Birgit Jenner
• Jacobo Torán

Keywords

No keywords are indexed for this paper.