Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: P. W. Beame / rank | |||
| Property / author | |||
| Property / author: P. W. Beame / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/060654645 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992641578 / rank | |||
Normal rank | |||
Latest revision as of 02:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity |
scientific article |
Statements
Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (English)
0 references
19 June 2008
0 references
propositional proof complexity
0 references
zero-one programming
0 references
communication complexity
0 references
lower bounds
0 references
