Abstract
In the first part we provide an elementary proof of the result of Homer and Mocas [3] that for all constant c, the class EXP is not included in 
. The proof is based on a simple diagonalization, whereas it uses resource-bounded Kolmogorov complexity in [3].
In the second part, we investigate links between resource-bounded Kolmogorov complexity and nonuniform classes in computational complexity. Assuming a weak version of polynomial-time symmetry of information, we show that exponential-time problems do not have polynomial-size circuits (in symbols, \({\mathsf {EXP}} \not\subset {\rm P/poly}\)).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 75–83. IEEE Computer Society Press, Los Alamitos (1978)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. EATCS monographs on theoretical computer science, vol. 11. Springer, Heidelberg (1988)
Homer, S., Mocas, S.: Nonuniform lower bounds for exponential time classes. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 159–168. Springer, Heidelberg (1995)
Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control 55, 40–56 (1982)
Karp, R., Lipton, R.: Turing machines that take advice. L’Enseignement Mathématique 28, 191–209 (1982)
Kolmogorov, A.: Combinatorial foundations of information theory and the calculus of probabilities. Russian Mathematical Surveys 38(4), 29–40 (1983)
Lee, T., Romashchenko, A.: Resource bounded symmetry of information revisited. Theoretical Computer Science, 345(2–3), 386–405 (2005), Earlier version in: 29th Symposium on the Mathematical Foundations of Computer Science (2004)
Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Graduate texts in computer science. Springer, Heidelberg (1997)
Longpré, L., Watanabe, O.: On symmetry of information and polynomial time invertibility. Information and Computation 121(1), 14–22 (1995)
Nisan, N., Wigderson, A.: Hardness vs randomness. Journal of Computer and System Sciences 49(2), 149–167 (1994)
Ronneburger, D.: Kolmogorov Complexity and Derandomization. PhD thesis, Rutgers University (2004)
Schöning, U.: Complexity and Structure. LNCS, vol. 211. Springer, Heidelberg (1986)
Vinodchandran, N.V.: A note on the circuit complexity of pp. In: Electronic Colloquium on Computational Complexity, Report No. 56 (July 2004)
Zvonkin, A., Levin, L.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys 25(6), 83–124 (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perifel, S. (2007). Symmetry of Information and Nonuniform Lower Bounds. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)