Abstract
We give some characterizations of the classes P NP[O(logk n)]. First, we show that these classes are equal to classes AC k−1(NP). Second, we prove that they are also equivalent to some classes defined in the Extended Boolean hierarchy. As a last characterization, we show that there exists a strong connection between classes defined by polynomial time Turing machines with few queries to an NP oracle and classes defined by small size circuits with NP oracle gates. With these results we solve open questions that arose in [Wa-90] and [AW-90]. Finally, we give an oracle relative to which classes P NP[O(logk n)] and P NP[O(logk+1 n)] are different.
Work partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075, project ALCOM.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Allender, C. B. Wilson, Width-Bounded Reducibility and Binary Search over Complexity Classes, Proc. 5th IEEE Conf. on Structure in Complexity Theory, (1990), pp. 122–129.
R. J. Beigel, Bounded queries to SAT and the Boolean hierarchy, To appear in TCS.
S. Buss, L. Hay, On truth-table reducibility to SAT, Information and Computation, vol. 91 (1991), pp. 86–102.
J. Cai, L. A. Hemachandra, The Boolean hierarchy: hardware over NP, Proc. 1st IEEE Conf. on Structure in Complexity Theory, (1986), pp. 105–124.
S. Cook, A taxonomy of problems with fast parallel algorithms, Information and Control, vol. 64 (1985), pp. 2–22.
J. Köbler, U. Schöning, K. W. Wagner, The difference and the truth-table hierarchies for NP, R.A.I.R.O. 21 (1987), pp. 419–435.
A. Lozano, J. Torán, Self-reducible sets of small density, Math. Systems Theory 24 (1991), pp. 83–100
K. W. Wagner, Bounded query classes, SIAM J. Comput., vol. 19, 5 (1990), pp. 833–846.
G. Wechsung, K. W. Wagner, On the Boolean closure of NP, manuscript 1985 (extended abstract as: Wechsung G., On the Boolean closure of NP, Proc. Conf. Wundam. Comp. Theory, Cottbus 1985, LNCS 199 (1985), pp. 485–493).
C. B. Wilson, Relativized NC, Math. Systems Theory, vol. 20 (1987), pp. 13–29.
C. B. Wilson, Decomposing NC and AC, SIAM J. Comput., vol. 19, 2 (1990), pp. 384–396.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, J., Seara, C. (1992). Characterizations of some complexity classes between Θ p2 and Δ p2 . In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_192
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_192
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive