Author:
Bauwens Bruno,Makhlin Anton,Vereshchagin Nikolay,Zimand Marius
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference30 articles.
1. B. Bauwens (2010). Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. Ph.D. thesis, Ghent University, Faculty of Engineering.
2. B. Bauwens, A. Makhlin, N. Vereshchagin & M. Zimand (2013). Short lists with short programs in short time. In the 28th IEEE Conference in Computational Complexity, Stanford, CA, June 5–7, 2013, 98–108.
3. Bauwens B., Shen A. (2014) Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity. The Journal of Symbolic Logic 79(02): 620–632
4. Beigel R., Buhrman H.M., Fejer P., Fortnow L., Grabowski P., Longpre L., Muchnik A., Stephan F., Torenvliet L. (2006) Enumerations of the Kolmogorov Function. The Journal of Symbolic Logic 71(2): 501–528
5. H. Buhrman, L. Fortnow & S. Laplante (2001). Resource-Bounded Kolmogorov Complexity Revisited. SIAM Journal on Computing 31(3), 887–905.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献