Lower bounds for Lovász-Schrijver systems and beyond follow from multiparty communication complexity

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1176-1188

  Beame, Paul ^a   Pitassi, Toniann ^b   Segerlind, Nathan ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

COMMUNICATION COMPLEXITY; POLYNOMIAL INEQUALITIES; PROOF SYSTEMS;

COMPUTER SCIENCE;

EID: 26444564641     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_95     Document Type: Conference Paper

References (22)

1. S. Arora, B. Bollobás, and L. Lovász. Proving integrality gaps without knowing the linear program. In Proceedings 43nd Annual Symposium on Foundations of Computer Science, pages 313-322, Vancouver, BC, November 2002. IEEE.
2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In 27th Annual Symposium on Foundations of Computer Science, pages 337-347, Toronto, Ontario, October 1986. IEEE.
3. P. Beame, T. Pitassi, N. Segerlind, and A. Wigderson. A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness. In Proceedings Twentieth Annual IEEE Conference on Computational Complexity, San Jose, CA, June 2005.
4. A. Bockmayr, F. Eisenbrand, M.E. Hartmann, and A.S. Schulz. On the Chvatal rank of polytopes in the 0/1 cube. Discrete Applied Mathematics, 98(1-2):21-27, 1999.
5. J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen, and T. Pitassi. Rank bounds and integrality gaps for cutting planes procedures. In Proceedings 44th Annual Symposium on Foundations of Computer Science, pages 318-327, Boston, MA, October 2003. IEEE.
6. V. Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305-337, 1973.
7. V. Chvátal, W. Cook, and M. Hartmann. On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications, 114/115:455-499, 1989.
8. W. Cook, C. R. Coullard, and G. Turan. On the complexity of cutting plane proofs. Discrete Applied Mathematics, 18:25-38, 1987.
9. S. Dash. On the matrix cuts of Lovász and Schrijver and their use in Integer Programming. PhD thesis, Department of Computer Science, Rice University, March 2001.
10. S. Dash. An exponential lower bound on the length of some classes of branch-and-cut proofs. In W. Cook and A. S. Schulz, editors, IPCO, volume 2337 of Lecture Notes in Computer Science, pages 145-160. Springer-Verlag, 2002.
11. F. Eisenbrand and A. S. Schulz. Bounds on the Chvatal rank of polytopes in the 0/1-cube. Combinatorica, 23 (2):245-261, 2003.
12. D. Grigoriev, E.A. Hirsch, and D.V. Pasechnik. Complexity of semi-algebraic proofs. In (STACS) 2002:19th Annual Symposium on Theoretical Aspects of Computer Science, volume 2285 of Lecture Notes in Computer Science, pages 419-430, Antibes, France, February 2002. Springer-Verlag.
13. R. Impagliazzo, T. Pitassi, and A. Urquhart. Upper and lower bounds on tree-like cutting planes proofs. In 9th Annual IEEE Symposium on Logic in Computer Science, pages 220-228, Paris, France, 1994.
14. B. Kalyanasundaram and Georg Schnitger. The probabilistic communication complexity of set intersection. In Proceedings, Structure in Complexity Theory, Second Annual Conference, pages 41-49, Cornell University, Ithaca, NY, June 1987. IEEE.
15. L. G. Khachian. A polynomial time algorithm for linear programming. Doklady Akademii Nauk SSSR, n.s., 244(5):1093-1096, 1979.
16. English translation in Soviet Math. Dokl. 20, 191-194.
17. L. Lovasz and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization, 1(2):166-190, 1991.
18. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
19. N. Nisan. The communication complexity of threshold gates. In V.S.D. Mikl'os and T. Szonyi, editors, Combinatorics: Paul Erdös is Eighty, Volume I, pages 301-315. Bolyai Society, 1993.
20. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic, 62(3):981-998, September 1997.
21. R. Raz and A. Wigderson. Monotone circuits for matching require linear depth. Journal of the ACM, 39(3):736-744, July 1992.
22. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, pages 85-93, 1986.