DocumentCode :
3242837
Title :
Bounded query functions with limited output bits
Author :
Chang, Richard ; Squire, Jon S.
Author_Institution :
Dept. of Comput. Sci. & Electr. Eng., Maryland Univ., Baltimore, MD, USA
fYear :
2001
fDate :
2001
Firstpage :
90
Lastpage :
98
Abstract :
The 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 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
Keywords :
computational complexity; NP-complete oracle; SAT; bounded query functions; function classes; limited output bits; parallel queries; polynomial hierarchy; polynomial-time bounded query language classes; serial queries; Computer science; Concurrent computing; Database languages; Polynomials; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Conference_Location :
Chicago, IL
Print_ISBN :
0-7695-1053-1
Type :
conf
DOI :
10.1109/CCC.2001.933876
Filename :
933876
Link To Document :
بازگشت