Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization-Reference-Cited by-同舟云学术

Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization

Published:2012-10-26 Issue:2 Volume:55 Page:299-312
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Musatov Daniil

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-012-9432-1.pdf

Reference23 articles.

1. Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advances in Computational Complexity Theory, pp. 1–20. American Mathematical Society, Providence (1993)

2. Buhrman, H., Fortnow, L., Laplante, S.: Resource bounded Kolmogorov complexity revisited. SIAM J. Comput. 31(3), 887–905 (2002)

3. Dvir, Z., Wigderson, A.: Kakeya sets, new mergers and old extractors. In: Proceedings of the 49th Annual FOCS08, pp. 625–633 (2008)

4. Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM 56(4) (2009)

5. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Berlin (1997)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inequalities for space-bounded Kolmogorov complexity;Computability;2022-12-21

2. On Algorithmic Statistics for Space-bounded Algorithms;Theory of Computing Systems;2018-02-06

3. On Algorithmic Statistics for Space-Bounded Algorithms;Computer Science – Theory and Applications;2017

4. On Extracting Space-bounded Kolmogorov Complexity;Theory of Computing Systems;2014-08-28