Non-deterministic communication complexity with few witnesses (Q1337464)
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 682619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-deterministic communication complexity with few witnesses |
scientific article; zbMATH DE number 682619 |
Statements
Non-deterministic communication complexity with few witnesses (English)
0 references
6 November 1994
0 references
communication protocols
0 references
communication complexity
0 references
Turing-complexity class
0 references
0 references
0.97845745
0 references
0.90278184
0 references
0.90264857
0 references
0.90138984
0 references
0.90138984
0 references
0.8961307
0 references
0.8958036
0 references
0.8933699
0 references
0.8908235
0 references
