Sciweavers

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

98

Voted

FOCS
1998
IEEE

72views Theoretical Computer Science» more FOCS 1998»

Randomness vs. Time: De-Randomization under a Uniform Assumption

15 years 7 months ago

Randomness vs. Time: De-Randomization under a Uniform Assumption

Download www.math.ias.edu

Russell Impagliazzo, Avi Wigderson

Real-time Traffic

FOCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Lowend uniform hardness vs randomness tradeoffs for AM

» Uniform hashing in constant time and linear space

» A simple expected running time analysis for randomized divide and conquer algorithms

» Extracting Randomness from Samplable Distributions

» Communication vs Computation

» Inapproximability Results for Maximum Edge Biclique Minimum Linear Arrangement and Sparses...

» A GraphBased Model for Disconnected Ad Hoc Networks

» Matching with PROSAC Progressive Sample Consensus

» Spatiotemporal multicast in sensor networks

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Russell Impagliazzo, Avi Wigderson

Comments (0)