Reductions to the Set of Random Strings: The Resource-Bounded Case-Reference-Cited by-同舟云学术

Reductions to the Set of Random Strings: The Resource-Bounded Case

Published:2012 Issue: Volume: Page:88-99
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2012
language:
Short-container-title:

Author:

Allender Eric,Buhrman Harry,Friedman Luke,Loff Bruno

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32589-2_11.pdf

Reference12 articles.

1. Lecture Notes in Computer Science;E. Allender,2012

2. Allender, E., Buhrman, H., Friedman, L., Loff, B.: Reductions to the set of random strings:the resource-bounded case. Technical Report TR12-054, ECCC (2012)

3. Allender, E., Buhrman, H., Koucký, M.: What can be efficiently reduced to the Kolmogorov-random strings? Annals of Pure and Applied Logic 138, 2–19 (2006)

4. Allender, E., Buhrman, H., Koucký, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM Journal on Computing 35, 1467–1493 (2006)

5. Allender, E., Davie, G., Friedman, L., Hopkins, S.B., Tzameret, I.: Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic. Technical Report TR12-028, ECCC (2012) (submitted for publication)

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

1. On characterizations of randomized computation using plain Kolmogorov complexity1;Computability;2018-01-16

2. The Complexity of Complexity;Computability and Complexity;2016-12-01

3. REDUCTIONS TO THE SET OF RANDOM STRINGS: THE RESOURCE-BOUNDED CASE;LOG METH COMPUT SCI;2014

4. On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity;Mathematical Foundations of Computer Science 2014;2014

5. Reductions to the Set of Random Strings: The Resource-Bounded Case;Mathematical Foundations of Computer Science 2012;2012