On polynomially time bounded symmetry of information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 463-475

  Lee, Troy ^a   Romashchenko, Andrei ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

KOLMOGOROV; KOLMOGOROV COMPLEXITY; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL-TIME; SYMMETRY OF INFORMATION;

POLYNOMIALS;

EID: 35048823098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_35     Document Type: Article

References (22)

1. E. Allender, H. Buhrman, M. Koucky, D. van Melkebeek, and D. Ronneburger. Power from random strings. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pages 669-678. IEEE, 2002.
2. L. Babai. Trading group theory for randomness. In Proceedings of the 17th ACM Symposium on the Theory of Computing, pages 421-429. ACM, 1985.
3. H. Buhrman and L. Fortnow. Distinguishing complexity and symmetry of information. Technical Report TR-95-11, Department of Computer Science, The University of Chicago, 1995.
4. H. Buhrman, L. Fortnow, and S. Laplante. Resource bounded Kolmogorov complexity revisited. SIAM Journal on Computing, 31(3):887-905, 2002.
5. H. Buhrman, S. Laplante, and P.B. Miltersen. New bounds for the language compression problem. In Proceedings of the 15th IEEE Conference on Computational Complexity, pages 126-130. IEEE, 2000.
6. H. Buhrman, T. Lee, and D. van Melkebeek. Language compression and pseudorandom generators. To appear in 19th IEEE Conference on Computational Complexity, 2004.
7. M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos. On completeness and soundness in interactive proof systems. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 429-442. JAI Press, Greenwich, 1989.
8. L. Fortnow and M. Kummer. On resource-bounded instance complexity. Theoretical Computer Science A, 161:123-140, 1996.
9. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way functions. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 41-61. ACM, 1989.
10. T. Jiang, J. Seiferas, and P. Vitányi. Two heads are better than two tapes. Journal of the ACM, 44(2):237-256, 1997.
11. A.N. Kolmogorov. Three approaches to the quantitative definition of information. Problems Information Transmission, 1(1):1-7, 1965.
12. T. Lee, A. Romashchenko. On Polynomially Time Bounded Symmetry of Information. Electronic Colloquium on Computational Complexity, Report TR04-031, April 2004.
13. L. A. Levin. Universal Search Problems. Problems Information Transmission, 9(3):265-266, 1973.
14. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York, second edition, 1997.
15. L. Longpré and S. Mocas. Symmetry of information and one-way functions. Information Processing Letters, 46(2):95-100, 1993.
16. L. Longpré and O. Watanabe. On symmetry of information and polynomial time invertibility. Information and Computation, 121(1):14-22, 1995.
17. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
18. D. Ronneburger. Personal Communication, 2004.
19. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages 330-335. ACM, 1983.
20. L. Trevisan. Construction of extractors using pseudo-random generators. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 141-148. ACM, 1999.
21. N. Vereshchagin and P. Vitányi. Kolmogorov's structure function with an application to the foundations of model selection. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pages 751-760. IEEE, 2002.
22. A. Zvonkin and L. Levin. The complexity of finite objects and the algorithmic concepts of information and randomness. Russian Mathematical Surveys, 25:83-124, 1970.