Nondeterministic communication complexity of random Boolean functions (extended abstract) (Q2988848)
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: Nondeterministic communication complexity of random Boolean functions (extended abstract) |
scientific article; zbMATH DE number 6721542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic communication complexity of random Boolean functions (extended abstract) |
scientific article; zbMATH DE number 6721542 |
Statements
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (English)
0 references
19 May 2017
0 references
communication complexity
0 references
random structures
0 references
0.7988395094871521
0 references
0.7985055446624756
0 references
0.7962788343429565
0 references
0.7943848371505737
0 references
