Sciweavers

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

9

JACM
1998

favoriteEmaildiscussreport

51views more JACM 1998»

Explicit OR-Dispersers with Polylogarithmic Degree

13 years 4 months ago

Explicit OR-Dispersers with Polylogarithmic Degree

Download www.cis.upenn.edu

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou

Real-time Traffic

JACM 1998 |

claim paper

Related Content

» Polylogarithmic Independence Can Fool DNF Formulas

» Nearoptimum Universal Graphs for Graphs with Bounded Degrees

» Counting Irreducible Components of Complex Algebraic Varieties

» Simple permutations mix even better

» Unbalanced Expanders and Randomness Extractors from ParvareshVardy Codes

» Artin automorphisms cyclotomic function fields and folded listdecodable codes

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	JACM
Authors	Michael E. Saks, Aravind Srinivasan, Shiyu Zhou

Comments (0)