The following claim states that, in each iteration, the sum of the deals of edges incident to a vertex v is bounded by β⋅w(v).
We proved that the leader election problem \LEn can exactly be solved with at most the same complexity (up to constant factor) as that of computing symmetric Boolean functions on an anonymous quantum network. In particular, the hardness of the leade…
This section contains a relatively detailed sketch of the proof of Theorem 1.8; The full proof will be provided in the full version of this paper.
There aren't more papers