ECCC-Report TR05-053https://eccc.weizmann.ac.il/report/2005/053Comments and Revisions published for TR05-053en-usThu, 12 May 2005 15:05:03 +0300
Paper TR05-053
| Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity |
Paul Beame,
Nathan Segerlind
https://eccc.weizmann.ac.il/report/2005/053We 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.
Thu, 12 May 2005 15:05:03 +0300https://eccc.weizmann.ac.il/report/2005/053