Sciweavers

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

113

Voted

FOCS
2010
IEEE

142views Theoretical Computer Science» more FOCS 2010»

Bounded Independence Fools Degree-2 Threshold Functions

15 years 24 days ago

Bounded Independence Fools Degree-2 Threshold Functions

Download www.math.harvard.edu

For an n-variate degree

Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson

Real-time Traffic

Boolean Threshold Functions | Explicit Pseudorandom Generators | FOCS 2010 | K-wise Independent Distribution | Theoretical Computer Science |

claim paper

Related Content

» kIndependent Gaussians Fool Polynomial Threshold Functions

» DistributionIndependent Evolvability of Linear Threshold Functions

» The Coin Problem and Pseudorandomness for Branching Programs

» DualBounded Generating Problems Partial and Multiple Transversals of a Hypergraph

» Lower Bounds for the Noisy Broadcast Problem

» GradientBased Methods for Sparse Recovery

» Adaptive Multiple Relay Selection Scheme for Cooperative Wireless Networks

» Distance graphs from random geometric graphs to Bernoulli graphs and between

» VapnikChervonenkis Dimension of Recurrent Neural Networks

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson

Comments (0)