Abstract
Unger studied the balanced leaf languages defined via poly-logarithmically sparse leaf pattern sets. Unger shows that NP-complete sets are not polynomial-time many-one reducible to such balanced leaf language unless the polynomial hierarchy collapses to Θ\(^{p}_{\rm 2}\) and that Σ\(^{p}_{\rm 2}\)-complete sets are not polynomial-time bounded-truth-table reducible (respectively), polynomial-time Turing reducible) to any such balanced leaf language unless the polynomial hierarchy collapses to Δ\(^{p}_{\rm 2}\) (respectively, Σ\(^{p}_{\rm 4}\)).
This paper studies the complexity of the class of such balanced leaf languages, which will be denoted by VSLL. In particular, the following tight upper and lower bounds of VSLL are shown:
1. coNP ⊆ VSLL ⊆ coNP/poly (the former inclusion is already shown by Unger).
2. coNP/1 \(\not\subseteq\) VSLL unless PH = Θ\(^{p}_{\rm 2}\).
3. For all constant c>0, VSLL \(\not\subseteq\) coNP/n c.
4. P/(loglog(n) + O(1)) ⊆ VSLL.
5. For all h(n) = loglog(n) + ω(1), P\(/h \not\subseteq\) VSLL.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences 38, 150–164 (1989)
Bovet, D., Crescenzi, P., Silvestri, R.: A uniform approach to define complexity classes. Theoretical Computer Science 104(2), 263–283 (1992)
Cai, J.: S2 p ⊆ ZPPNP. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 620–629. IEEE Computer Society Press, Los Alamitos (2001)
Cai, J., Chakaravarthy, V., Hemaspaandra, L., Ogihara, M.: Competing provers yield improved Karp–Lipton collapse results. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 535–546. Springer, Heidelberg (2003)
Cai, J., Furst, M.: PSPACE survives constant-width bottlenecks. International Journal on Foundations of Computer Science 2(1), 67–76 (1991)
Canetti, R.: More on BPP and the polynomial-time hierarchy. Information Processing Letters 57(5), 237–241 (1996)
Fortnow, L., Ogihara, M.: Very sparse leaf languages. Technical Report 899. Department of Computer Science, University of Rochester, Rochester, NY (June 2006)
Goldschlager, L., Parberry, I.: On the construction of parallel computers from various bases of boolean functions. Theoretical Computer Science 43, 43–58 (1986)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(3), 690–728 (1991)
Kadin, J.: PNP[logn] and sparse Turing-complete sets for NP. SIAM Journal on Computing 17(6), 1263–1282 (1988); Erratum 20(2), 404 (1991)
Karp, R., Lipton, R.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 302–309. ACM Press, New York (1980)
Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and its application. Springer, New York (1993)
Ogiwara, M., Watanabe, O.: On polynomial time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal of Computing 20(3), 471–483 (1991)
Russell, A., Sundaram, R.: Symmetric alternation captures BPP. Computational Complexity 7(2), 152–162 (1998)
Unger, F.: On small hard leaf languages. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 781–792. Springer, Heidelberg (2005)
Yap, C.-K.: Consequences of non-uniform conditions on uniform classes. Theoretical Computer Science 26, 287–300 (1983)
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
Fortnow, L., Ogihara, M. (2006). Very Sparse Leaf Languages. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_33
Download citation
DOI: https://doi.org/10.1007/11821069_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37791-7
Online ISBN: 978-3-540-37793-1
eBook Packages: Computer ScienceComputer Science (R0)