The unbounded-error communication complexity of symmetric functions (Q2428632): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:02, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The unbounded-error communication complexity of symmetric functions |
scientific article |
Statements
The unbounded-error communication complexity of symmetric functions (English)
0 references
26 April 2012
0 references
The paper proves that the unbounded-error communication complexity of every symmetric function \(f(x,y) = D(| x \wedge y| )\), where \(D\) is a predicate on \(\{0,1,,\cdots ,n\}\) and \(x,y \in \{0,1\}^{n}\), is between \(\theta (k/log^{5} n)\) and \(\theta (k log n)\), where \(k\) is the number of value changes of D in \(\{0,1,\dots ,n\}\).
0 references
unbounded-error communication complexity
0 references
symmetric functions
0 references