On relations between counting communication complexity classes (Q1880784)
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: On relations between counting communication complexity classes |
scientific article; zbMATH DE number 2104538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On relations between counting communication complexity classes |
scientific article; zbMATH DE number 2104538 |
Statements
On relations between counting communication complexity classes (English)
0 references
1 October 2004
0 references
We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established
0 references
Communication complexity class
0 references
Protocol
0 references
Non-determinism
0 references
Probabilism
0 references
Modularity
0 references
Upper bound
0 references
Lower bound
0 references
0 references
0 references
