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

Paul Beame, Toniann Pitassi, Nathan Segerlind. Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity. Electronic Colloquium on Computational Complexity (ECCC), (053), 2005. [doi]

Authors

Paul Beame

This author has not been identified. Look up 'Paul Beame' in Google

Toniann Pitassi

This author has not been identified. Look up 'Toniann Pitassi' in Google

Nathan Segerlind

This author has not been identified. Look up 'Nathan Segerlind' in Google