On relations between counting communication complexity classes (Q1880784): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2004.03.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018302254 / rank | |||
Normal rank | |||
Revision as of 19:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On relations between counting communication complexity classes |
scientific article |
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
