Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)
暂无分享,去创建一个
[1] Alexander Shen,et al. Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma , 2013, Fundam. Informaticae.
[2] Nikolai K. Vereshchagin,et al. Short lists with short programs in short time , 2013, 2013 IEEE Conference on Computational Complexity.
[3] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.
[4] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[5] Ran Raz,et al. On recycling the randomness of states in space bounded computation , 1999, STOC '99.
[6] Jaikumar Radhakrishnan,et al. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..
[7] Jason Teutsch. Short lists for shorter programs in short time , 2012, ArXiv.
[8] Claude E. Shannon,et al. Computability by Probabilistic Machines , 1970 .
[9] 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 .
[10] Jason Teutsch,et al. Short lists for shortest descriptions in short time , 2012, computational complexity.
[11] Marius Zimand. Short Lists with Short Programs in Short Time - A Short Proof , 2014, CiE.
[12] Aaron D. Wyner,et al. Computability by Probabilistic Machines , 1993 .
[13] Lance Fortnow,et al. Enumerations of the Kolmogorov function , 2006, Journal of Symbolic Logic.
[14] Gregory J. Chaitin. Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..
[15] Lance Fortnow,et al. Resource-Bounded Kolmogorov Complexity Revisited , 1997, STACS.
[16] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .