Sciweavers

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

10

MFCS
2001
Springer

favoriteEmaildiscussreport

54views Theoretical Computer Science» more MFCS 2001»

Randomness and Reducibility

13 years 9 months ago

Randomness and Reducibility

Download www.math.uchicago.edu

Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey L

Real-time Traffic

MFCS 2001 | Theoretical Computer Science |

claim paper

Related Content

» Lower Bounds for Reducibility to the Kolmogorov Random Strings

» Reducing the Cost of Generating APHDistributed Random Numbers

» Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves

» Separations by Random Oracles and Almost Classes for Generalized Reducibilities

» Reduced feedback schemes using random beamforming in MIMO broadcast channels

» Randomization does not reduce the average delay in parallel packet switches

» DualRail Random Switching Logic A Countermeasure to Reduce Side Channel Leakage

» On the RandomSelfReducibility of Complete Sets

» Scheduling RandomlyDeployed Heterogeneous Video Sensor Nodes for Reduced Intrusion Detecti...

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	MFCS
Authors	Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte

Comments (0)