Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR05-053 | 4th May 2005 00:00

Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity

RSS-Feed




TR05-053
Authors: Paul Beame, Nathan Segerlind
Publication: 12th May 2005 15:05
Downloads: 1327
Keywords: 


Abstract:

We prove that an \omega(log^3 n) lower bound for the three-party number-on-the-forehead (NOF) communication complexity of the set-disjointness function implies an n^\omega(1) size lower bound for tree-like Lovasz-Schrijver systems that refute unsatisfiable CNFs. More generally, we prove that an n^\Omega(1) lower bound for the (k+1)-party NOF communication complexity of set-disjointness implies a 2^{n^\Omega(1)} size lower bound for all tree-like proof systems whose formulas are degree k polynomial inequalities.



ISSN 1433-8092 | Imprint