Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

CIE
2010
Springer

favoriteEmaildiscussreport

119views Applied Computing» more CIE 2010»

Lower Bounds for Reducibility to the Kolmogorov Random Strings

13 years 5 months ago

Lower Bounds for Reducibility to the Kolmogorov Random Strings

Download www.cs.uwyo.edu

Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.

John M. Hitchcock

Real-time Traffic

Applied Computing | CIE 2010 | Kolmogorov Random Strings | Polynomial-time Reducibility | Random |

claim paper

Related Content

» Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extr...

» Possibilities and impossibilities in Kolmogorov complexity extraction

» Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

» Scaled Dimension and the Kolmogorov Complexity of TuringHard Sets

» Depth as Randomness Deficiency

» Lower Bounds Using Kolmogorov Complexity

» Derandomizing from Random Strings

» Lower Bounds for Oblivious Transfer Reductions

» Language Compression and Pseudorandom Generators

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2010
Where	CIE
Authors	John M. Hitchcock

Comments (0)