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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.