Separating counting communication complexity classes (Q5096788)
From MaRDI portal
scientific article; zbMATH DE number 7573037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating counting communication complexity classes |
scientific article; zbMATH DE number 7573037 |
Statements
Separating counting communication complexity classes (English)
0 references
18 August 2022
0 references
complexity of Boolean functions
0 references
communication complexity
0 references
distributed computing
0 references
probabilism
0 references
lower bound arguments
0 references
separation of complexity classes
0 references
0 references
0 references
