Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (Q5390003): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1557064786 / rank | |||
Normal rank | |||
| Property / title | |||
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (English) | |||
| Property / title: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (English) / rank | |||
Normal rank | |||
Revision as of 10:04, 30 July 2024
scientific article; zbMATH DE number 6027242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness |
scientific article; zbMATH DE number 6027242 |
Statements
24 April 2012
0 references
computational complexity
0 references
communication complexity
0 references
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (English)
0 references
