Sciweavers

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

10

ECCC
2010

favoriteEmaildiscussreport

80views more ECCC 2010»

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

13 years 4 months ago

Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

Download pages.cs.wisc.edu

Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel

Real-time Traffic

ECCC 2010 |

claim paper

Related Content

» Pseudorandom Generators and TypicallyCorrect Derandomization

» NearOptimal Conversion of Hardness into PseudoRandomness

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

» Pseudorandom graphs and bit probe schemes with onesided error

» On the Exact Space Complexity of Sketching and Streaming Small Norms

» Boundeddepth circuits cannot sample good codes

» Balls and Bins Smaller Hash Families and Faster Evaluation

» AlmostNatural Proofs

» Hardness vs Randomness within Alternating Time

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ECCC
Authors	Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel

Comments (0)