Sciweavers

Share
COCO
2001
Springer

Bounded Query Functions with Limited Output Bits

10 years 2 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For polynomial-time bounded query language classes, which can be considered as functions with 1-bit output, previous work has shown that 2 serial queries to SAT is equivalent to 3 parallel queries to SAT. In contrast, for function classes with no limit on the number of output bits, previous work has shown that there exists a function that can be computed in polynomial time using 3 parallel queries to SAT, but cannot be computed using 2 serial queries to SAT, unless P = NP. The results in this paper show that there exists a function with 2-bit output that can be computed using 3 parallel queries to SAT, but cannot be computed using 2 serial queries to SAT, unless the Polynomial Hierarchy collapses.
Richard Chang, Jon S. Squire
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where COCO
Authors Richard Chang, Jon S. Squire
Comments (0)
books