Sciweavers

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

28

APPROX
2010
Springer

favoriteEmaildiscussreport

120views Algorithms» more APPROX 2010»

Improved Pseudorandom Generators for Depth 2 Circuits

14 years 13 days ago

Improved Pseudorandom Generators for Depth 2 Circuits

Download www.cs.berkeley.edu

Anindya De, Omid Etesami, Luca Trevisan, Madhur Tu

Real-time Traffic

Algorithms | APPROX 2010 |

claim paper

Related Content

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

» Hard Sets and Pseudorandom Generators for Constant Depth Circuits

» Pseudorandom generators without the XOR Lemma

» Improvement of the Fault Coverage of the PseudoRandom Phase in ColumnMatching BIST

» Analysis and Improvement of a Pseudorandom Number Generator for EPC Gen2 Tags

» Boundeddepth circuits cannot sample good codes

» The complexity of constructing pseudorandom generators from hard functions

» Pseudorandom generators for low degree polynomials

» On the Complexity of Hardness Amplification

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani

Comments (0)