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

被引：0

作者：

Beame, P ^{[1
]}

Pitassi, T

Segerlind, N

机构：

[1] Univ Washington, Seattle, WA 98195 USA

[2] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 1A4, Canada

来源：

AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2005年 / 3580卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 unsatistiable CNFs. More generally, we prove that an n(Omega(1)) lower bound for the (k + I) -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.

引用

页码：1176 / 1188

页数：13

共 50 条

[1] Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity
Beame, Paul
Pitassi, Toniann
Segerlind, Nathan
SIAM JOURNAL ON COMPUTING, 2007, 37 (03) : 845 - 869
[2] New lower bounds for Vertex Cover in the Lovasz-Schrijver hierarchy
Tourlakis, Iannis
CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 170 - 179
[3] Lower bounds of static Lovasz-Schrijver calculus proofs for Tseitin tautologies
Kojevnikov, Arist
Itsykson, Dmitry
AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 323 - 334
[4] EXPONENTIAL LOWER BOUNDS AND INTEGRALITY GAPS FOR TREE-LIKE LOVASZ-SCHRIJVER PROCEDURES
Pitassi, Toniann
Segerlind, Nathan
SIAM JOURNAL ON COMPUTING, 2012, 41 (01) : 128 - 159
[5] Exponential lower bounds and Integrality Gaps for Tree-like Lovasz-Schrijver Procedures
Pitassi, Toniann
Segerlind, Nathan
PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 355 - +
[6] Rank complexity gap for Lovasz-Schrijver and Sherali-Adams proof systems
Dantchev, Stefan
Martin, Barnaby
COMPUTATIONAL COMPLEXITY, 2013, 22 (01) : 191 - 213
[7] Rank Complexity Gap for Lovasz-Schrijver and Sherali-Adams Proof Systems
Dantchev, Stefan
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 311 - 317
[8] Lower bounds on the multiparty communication complexity
Duris, P
Rolim, JDP
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (01) : 90 - 95
[9] A linear round lower bound for Lovasz-Schrijver SDP relaxations of vertex cover
Schoenebeck, Grant
Trevisan, Luca
Tulsiani, Madhur
TWENTY-SECOND ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2007, : 205 - +
[10] Lower bounds on quantum multiparty communication complexity
Lee, Troy
Schechtman, Gideon
Shraibman, Adi
PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 254 - +

← 1 2 3 4 5 →