Abstract
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Toran [10] that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also show that this result is optimal with respect to relativizing proofs, by exhibiting an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, M., Arvind, V.: Quasi-linear truth-table reductions to p-selective sets. Theoretical Computer Science 158, 361–370 (1996)
Beigel, R., Kummer, M., Stephan, F.: Approximable sets. Information and Computation 120, 304–314 (1995)
Berman, L., Hartmanis, H.: On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, 305–322 (1977)
Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: IEEE Conference on Computational Complexity, pp. 8–12. IEE Computer Society Press (1998)
Buhrman, H., Torenvliet, L.: P-selective self-reducible sets: A new characterization of P. J. Computer and System Sciences 53, 210–217 (1996)
Fortnow, L., Klivans, A.: NP with small advice. In: Proceedings of the 20th IEEE Conference on Computationa Complexity, IEEE Computer Society Press, Los Alamitos (2005)
Hemaspaandra, L., Torenvliet, L.: Theory of Semi-Feasible Algorithms. In: Monographs in Theoretical Computer Science, Springer, Heidelberg (2002)
Ko, K.I.: On self-reducibility and weak P-selectivity. J. Comput. System Sci. 26, 209–211 (1983)
Ko, K., Schöning, U.: On circuit-size and the low hierarchy in NP. SIAM J. Comput. 14, 41–51 (1985)
Lozano, A., Torán, J.: Self-reducible sets of small density. Mathematical Systems Theory (1991)
Meyer, A.: oral communication. cited in [3] (1977)
Mocas, S.: Separating Exponential Time Classes from Polynomial Time Classes. PhD thesis, Northeastern University (1993)
Ogihara, M.: Polynomial-time membership comparable sets. SIAM Journal on Computing 24, 1168–1181 (1995)
Ogiwara, M., Watanabe, O.: On polynomial time bounded truth-table reducibility of NP sets to sparse sets. SIAM J. Comput. 20, 471–483 (1991)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Selman, A.: P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory 13, 55–65 (1979)
Selman, A.: Analogues of semicursive sets and effective reducibilities to the study of NP complexity. Information and Control 52, 36–51 (1982)
Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. Technical Report TR04-086, ECCC (2004)
Wagner, K.: Bounded query computations. In: Proc. 3rd Structure in Complexity in Conference, pp. 260–278. IEEE Computer Society Press, Los Alamitos (1988)
Wilson, C.: Relativized circuit complexity. J. Comput. System Sci. 31, 169–181 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buhrman, H., Torenvliet, L., Unger, F. (2006). Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_37
Download citation
DOI: https://doi.org/10.1007/11672142_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)