Abstract
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f 1,…,f k and each of Alice and Bob has k inputs, x 1,…,x k and y 1,…,y k , respectively. In the eliminate problem, Alice and Bob should output a vector σ1,…,σ k such that f i (x i , y i ) ≠ σ i for at least one i (i.e., their goal is to eliminate one of the 2k output vectors); in the choose problem, Alice and Bob should return (i, f i (x i , y i )), for some i (i.e., they choose one instance to solve), and in the agree problem they should return f i (x i , y i ), for some i (i.e., if all the k Boolean values agree then this must be the output). The question, in each of the three cases, is whether one can do better than solving one (say, the first) instance. We study these three problems and prove various positive and negative results. In particular, we prove that the randomized communication complexity of eliminate, of k instances of the same function f, is characterized by the randomized communication complexity of solving one instance of f.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Agrawal & V. Arvind (1994). Polynomial time truth-table reductions to P-selective sets. In Structure in Complexity Theory Conference, 24–30.
Ambainis A., Buhrman H, Gasarch W, Kalyanasundaramd B., Torenvliete L. (2001) The communication complexity of enumeration, elimination, and selection. Journal of Computer and System Sciences 63(2): 148–185
A. Amihood, R. Beigel & W. I. Gasarch (2000). Some connections between bounded query classes and non-uniform complexity. Technical Report 024, Electronic Colloquium on Computational Complexity.
Z. Bar-Yossef, T. S. Jayram, R Kumar & D. Sivakumar (2002). An information statistics approach to data stream and communication complexity. In Proceedings of the 43nd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 209–218.
B. Barak, M. Braverman, X. Chen & A. Rao (2010). How to compress interactive communication. In Proceedings of the Fourty-second Annual ACM Symposium on Theory of Computing, Cambridge, MA, USA, 67–76.
P. Beame, T. Pitassi, N. Segerlind & A. Wigderson (2005). A direct sum theorem for corruption and the multiparty nof communication complexity of set disjointness. In the Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 52–66.
Beigel R, Gasarch W.I., Gill J., Owings J.C (1993) Terse, superterse, and verbose sets. Inf. Comput. 103(1): 68–85
Beigel R., Gasarch W. I., Kummer M., Martin G., McNicholl T., Stephan F., (2000) The complexity of \({{\rm Odd}^{A}_{n}}\). Journal of Symbolic Logic 65(1): 1ndash;18
R. Beigel & T. Hirst (1998). One help-bit doesn’t help. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, DallasTX, 124–130.
Beigel R., Kummer M., Stephan F. (1994) Approximable sets. Information and Computation 120: 12–23
Cai J., Hemachandra L.A. (1989) Enumerative counting is hard. Information and Control 82(1): 34–44
A. Chakrabarti, Y. Shi, A. Wirth & A. Yao (2001). Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas NV, 270–278.
J. Edmonds, R. Impagliazzo, S. Rudich & J. Sgall (1991). Communication complexity towards lower bounds on circuit depth. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan PR, 249–257.
Feder T., Kushilevitz E., Naor M., Nisan N. (1995) Amortized communication complexity. SIAM Journal on Computing 24(4): 736–750
Galbiati G., Fischer M.J. (1981) On the complexity of 2-output Boolean networks. Theoretical Computer Science 16: 177–185
Gasarch W., Martin G. (1998) Bounded Queries in Recursion Theory. Birkhäuser Verlag, Boston
Hemaspaandra L.A., Torenvliet L. (2003) Theory of Semi-Feasible Algorithms. Springer-Verlag, New York
R. Impagliazzo, R. Raz & A. Wigderson (1994). A direct product theorem. In Structure in Complexity Theory Conference, 88–96.
R. Jain, H. Klauck & M. Santha (2010). Optimal direct sum results for deterministic and randomized decision tree complexity. Technical Report 1004.0105v1, arxiv.org. http://arxiv.org/abs/1004.0105v1.
R. Jain, J. Radhakrishnan & P. Sen (2003). A direct sum theorem in communication complexity via message compression. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming ICALP 2003, Eindhoven, The Netherlands, 300–315.
Jockusch C. (1968) Semirecursive sets and positive reducibility. Transactions of the American Mathematical Society 131(2): 420–436
Kalyanasundaram B., Schnitger G. (1992) The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5(4): 545–557
M. Karchmer, E. Kushilevitz & N. Nisan, (1995a). Fractional covers and communication complexity. SIAM Journal on Discrete Mathematics 8(1), 76–92.
M. Karchmer, R. Raz & A. Wigderson (1995B). Super-logarithmic depth lower bounds via the direct sum in communication complexity. Computational Complexity 5(3/4), 191–204.
Karchmer M., Wigderson A. (1990) Monotone circuits for connectivity require super-logarithmic depth. SIAM Journal on Discrete Mathematics 3(2), 255–265
Ko K. (1983) On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences 26(2): 209–221
Kummer M. (1992) A proof of Beigel’s cardinality conjecture. Journal of Symbolic Logic 57(2): 677–681
E. Kushilevitz & N. Nisan (1997). Communication Complexity. Cambridge University Press.
Newman I. (1991) Private vs. common random bits in communication complexity. Inf. Process. Lett. 39(2): 67–71
Nisan N., Rudich S., Saks M. (1999) Products and help bits in decision trees. SIAM Journal on Computing 28(3): 1035–1050
I. Parnafes, R. Raz & A. Wigderson (1997). Direct product results and the GCD problem, in old and new communication models. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, El Paso TX, 363–372.
W.J. Paul (1974). Realizing Boolean functions on disjoint sets of variables. Technical report, Cornell University, Ithaca, NY, USA.
A. A. Razborov (1990). On the distributional complexity of disjointness. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming ICALP 1990, Warwick, UK, 249–253. Springer.
A. L. Selman (1979). P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. In Proceedings of the 6th International Colloquium on Automata, Languages and Programming ICALP 1979, London, UK, 546–555. Springer-Verlag. ISBN 3-540-09510-1.
A. L. Selman (1982a). Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity. Information and Control 52(1), 36–51.
A. L. Selman (1982B). Reductions on NP and P-Selective Sets. Theor. Comput. Sci. 19, 287–304.
R. Shaltiel (2001). Towards proving strong direct product theorems. In Proceedings of the 16th IEEE Conference on Computational Complexity, Chicago IL, 107–119.
Sivakumar D. (1999) On membership comparable sets. Journal of Computer and System Sciences 59(2): 270–280
Uhlig D. (1974) On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements. Mat. Zametki 15: 937–944
A. C. Yao (1979). Some complexity questions related to distributed computing. In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, Atlanta GA, 209–213.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Beimel, A., Ben Daniel, S., Kushilevitz, E. et al. Choosing, Agreeing, and Eliminating in Communication Complexity. comput. complex. 23, 1–42 (2014). https://doi.org/10.1007/s00037-013-0075-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-013-0075-7