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

COCO

2011

Springer

2011

Springer

We consider a system of linear constraints over any ﬁnite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and each Ai ⊂ G, i,j is an element of G and xi’s are Boolean variables. Our main result shows that the subset of the Boolean cube that satisﬁes these constraints has exponentially small correlation with the MODq boolean function, when the order of G and q are co-prime numbers. Our work extends the recent result of Chattopadhyay and Wigderson (FOCS’09) who obtain such a correlation bound for linear systems over cyclic groups whose order is a product of two distinct primes or has at most one prime factor. Our result also immediately yields the ﬁrst exponential bounds on the size of boolean depth-four circuits of the form MAJ◦AND◦ANYO(1)◦ MODm for computing the MODq function, when m, q are co-prime. No superpolynomial lower bounds were known for such circuits for computing any explicit function. This ...

Related Content

Added |
18 Dec 2011 |

Updated |
18 Dec 2011 |

Type |
Journal |

Year |
2011 |

Where |
COCO |

Authors |
Arkadev Chattopadhyay, Shachar Lovett |

Comments (0)