Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1822913 |
Changed an Item |
||
| Property / author | |||
| Property / author: P. W. Beame / rank | |||
Normal rank | |||
Revision as of 12:44, 29 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
