Resource bounded symmetry of information revisited
暂无分享,去创建一个
[1] Troy Lee,et al. On Polynomially Time Bounded Symmetry of Information , 2004, MFCS.
[2] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[3] Luca Trevisan,et al. Compression of Samplable Sources , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[4] Osamu Watanabe,et al. On Symmetry of Information and Polynomial Time Invertibility , 1992, Inf. Comput..
[5] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[6] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[7] Harry Buhrman,et al. Language compression and pseudorandom generators , 2004 .
[8] Eric Allender,et al. Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[9] H. Lenstra,et al. Factoring integers with the number field sieve , 1993 .
[10] Lance Fortnow,et al. NP might not be as easy as detecting unique solutions , 1997, STOC '98.
[11] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[12] V. Rich. Personal communication , 1989, Nature.
[13] Nikolai K. Vereshchagin,et al. Kolmogorov's structure functions with an application to the foundations of model selection , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[14] Peter Bro Miltersen,et al. New bounds for the language compression problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[15] Lance Fortnow,et al. On Resource-Bounded Instance Complexity , 1996, Theor. Comput. Sci..
[16] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[17] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[18] Oded Goldreich,et al. On Completeness and Soundness in Interactive Proof Systems , 1989, Adv. Comput. Res..
[19] Lance Fortnow,et al. Resource-Bounded Kolmogorov Complexity Revisited , 2001, SIAM J. Comput..
[20] Sarah Mocas,et al. Symmetry of Information and One-Way Functions , 1993, Inf. Process. Lett..
[21] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[22] Lance Fortnow,et al. Distinguishing Complexity and Symmetry of Information , 1995 .
[23] Ker-I Ko,et al. Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..
[24] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[25] Hoeteck Wee. On pseudoentropy versus compressibility , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[26] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.