Separating counting communication complexity classes (Q5096788): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3359756 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3974873 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP is as easy as detecting unique solutions / rank | |||
Normal rank | |||
Latest revision as of 21:43, 29 July 2024
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
