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:2011 Issue: Volume: Page:64-76
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Musatov Daniil

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20712-9_6

Reference21 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 Journal on Computing 31(3), 887–905 (2002)

3. Buhrman, H., Lee, T., van Melkebeek, D.: Language compression and pseudorandom generators. In: Proc. of the 15th IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2004)

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

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

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

1. Short lists with short programs in short time;computational complexity;2017-04-19

2. Short lists for shortest descriptions in short time;computational complexity;2014-09-06

3. Short Lists with Short Programs in Short Time;2013 IEEE Conference on Computational Complexity;2013-06

4. Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization;Theory of Computing Systems;2012-10-26

5. Space-Bounded Kolmogorov Extractors;Computer Science – Theory and Applications;2012