Paul Beame, Toniann Pitassi, Nathan Segerlind. Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 1176-1188, Springer, 2005. [doi]
Abstract is missing.