| Issue |
RAIRO-Theor. Inf. Appl.
Volume 34, Number 1, January/February 2000
|
|
|---|---|---|
| Page(s) | 61 - 75 | |
| DOI | https://doi.org/10.1051/ita:2000107 | |
| Published online | 15 April 2002 | |
Construction of Very Hard Functions for Multiparty Communication Complexity
Department of Mathematics and
Turku Centre for Computer Science,
University of Turku,
Turku, Finland;
(manuch@cs.utu.fi)
Received:
4
September
1999
Accepted:
20
March
2000
We consider the multiparty communication model defined in [4] using the formalism from [8]. First, we correct an inaccuracy in the proof of the fundamental result of [6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, i.e., functions such that those as well as their complements have the worst possible nondeterministic communication complexity. The problem to find a particular very hard function was proposed in [7], where it has been shown that almost all functions are very hard. We also prove that combining two very hard functions by the Boolean operation xor gives a very hard function.
Mathematics Subject Classification: 68Q15 / 68Q85
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.