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 FL log NP, FP log NP, and FP ∥ NP a...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 141; no. 1; pp. 175 - 193
Main Authors: Jenner, Birgit, Torán, Jacobo
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 17.04.1995
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
NP complete problem
Parallel computation
Algorithm
Computational complexity
Computing method
Polynomial time
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 FL log NP, FP log 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 FL log NP coincides with any of the other classes then L = P, and that the equality of the classes FP log 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) .
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(94)00080-3