Lower Bounds for Approximating Graph Parameters via Communication Complexity (Q6291236)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower Bounds for Approximating Graph Parameters via Communication Complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Approximating Graph Parameters via Communication Complexity |
scientific article |
Statements
13 September 2017
0 references
cs.CC
0 references
math.CO
0 references
