Abstract
The concepts of the relativized nonuniform and strong nonuniform lowness are introduced and studied. Those notions provide a uniform framework to study connections between the polynomial-time hierarchy and sparse sets.
This research is supported in part by HTP863 and The Youth NSF grand of China.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Balcázar, R. Book and U. Schöning, The polynomial-time hierarchy and sparse oracles, J. ACM 33(1986) 603–617.
J. Balcázar, R. Book and U. Schöning, Sparse sets, lowness, and highness, SIAM J. Comput. 15(1986) 739–747.
J. Balcázar, J. Dian and J. Gabarro, Structural Complexity I, II Springer-Verlag, 1988 and 1990.
R. Karp and R. Lipton, Some connections between nonuniform and uniform comlpexity classes, in: Proc, 12th ACM STOC (1980) 302–309.
K. Ko and U. Schöning, On circuit-size and the low hierarchy in NP, SIAM J. Comput. 14(1985) 41–51.
H. Li, The polynomial-time hierarchy and oracle set A ε PH/poly, Chinese Sci. Bulletin 35/36 (1990/1991) 322–325/17-20.
T. Long and A. Selman, Relativizing complexity classes with sparse oracles, J. ACM 33(1986) 618–627.
S. Mahaney, Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, J. Comput. System Sci 25(1982) 130–143.
M. Ogiwara and O. Watanabe, On polynomial-time bounded truth-table reducibility of NP sets to sparse sets, SIAM J. Comput 20(1991) 471–483.
U. Schöning, A low and a high hierarchy within NP, J. Comput. System Sci. 27(1983) 14–28.
U. Schöning, On small generators, Theoret. Comput. Sci 27(1983) 14–28.
U. Schöning, Complexity and Structure, Lecture Notes in Computer Scince, Vol 211 (1986).
L. Stockmeyer, The polynomial time hierarchy, Theort. Comput. Sci 3(1976) 1–22.
C. Wrathall, Complete sets and the polynomial-time hierarchy, Theort. Comput. Sci 3(1976) 23–33.
C. Yap, Some consequences of nonuniform conditions on uniform classes, Theort. Comput. Sci 27(1983) 287–300.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, HZ., Li, GY. (1994). Nonuniform lowness and strong nonuniform lowness. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_227
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_227
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive