A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6958543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on multiparty communication complexity and the Hales-Jewett theorem |
scientific article; zbMATH DE number 6958543 |
Statements
A note on multiparty communication complexity and the Hales-Jewett theorem (English)
0 references
19 October 2018
0 references
computational complexity
0 references
Ramsey theory
0 references
Hales-Jewett theorem
0 references
0.9091038
0 references
0.90889823
0 references
0.9088616
0 references
0.9061218
0 references
0 references
0 references
0.8918586
0 references
