An Application of Hindman's Theorem to a Problem on Communication Complexity (Q4655908)
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 2142660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Application of Hindman's Theorem to a Problem on Communication Complexity |
scientific article; zbMATH DE number 2142660 |
Statements
An Application of Hindman's Theorem to a Problem on Communication Complexity (English)
0 references
8 March 2005
0 references
0.7548176646232605
0 references
0.720289945602417
0 references
0.7129254937171936
0 references
