Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:08, 5 February 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
