Publisher
Springer International Publishing
Reference16 articles.
1. Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advanced in Computational Complexity Theory, pp. 1–20. American Mathematical Society (1993)
2. Buhrman, H., Fortnow, L., Laplante, S.: Resource-Bounded Kolmogorov complexity revisited. SIAM J. Comput. 31(3), 887–905 (2002)
3. Furst, M., Saxe, J.B., Sipser, M.: Math. Syst. Theory 17(1), 13–27 (1984)
4. Kolmogorov, A.N.: Approaches, three approaches to the quantitative definition of information. Problems Inf. Transmission 1(1), 4–11 (1965). English translation published in Int. J. Comput. Math. 2, 157–168 (1968)
5. Li, P., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn, p. 792. Springer, Heidelberg (1993). 1st edn. 1993; 2nd edn. 1997
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献