A separation of NP and conp in multiparty communication complexity (Q3002823)
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 5899296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A separation of NP and conp in multiparty communication complexity |
scientific article; zbMATH DE number 5899296 |
Statements
24 May 2011
0 references
multiparty communication complexity
0 references
nondeterminism
0 references
Merlin-Arthur computations
0 references
separations and lower bounds
0 references
0.8558986783027649
0 references
0.8173470497131348
0 references
0.8032023906707764
0 references
0.8025420904159546
0 references
0.7963869571685791
0 references
