Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) |
scientific article |
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
