Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
Year: 2007
Type: article
Source: SIAM Journal on Computing
DOI: 10.1137/060654645
Authors: Paul Beame, Toniann Pitassi, Nathan Segerlind
Institutions: University of Washington, University of Toronto
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W358628003
