Choosing, Agreeing, and Eliminating in Communication Complexity

We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1,…,fk and each of Alice and Bob has k inputs, x1,…,xk and y1,…,yk, respectively. In the eliminate problem, Alice and Bob should output a vector σ1,…,σk such that fi(xi, yi) ≠ σ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, fi(xi, yi)), for some i (i.e., they choose one instance to solve), and in the agree problem they should return fi(xi, yi), 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.

[1]  Wolfgang J. Paul.  Realizing Boolean Functions on Disjoint sets of Variables , 1976, Theor. Comput. Sci..

[2]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[3]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[4]  Richard Beigel,et al.  One help-bit doesn't help , 1998, STOC '98.

[5]  Martin Kummer.  A Proof of Beigel's Cardinality Conjecture , 1992, J. Symb. Log..

[6]  Ravi Kumar,et al.  An information statistics approach to data stream and communication complexity , 2004, J. Comput. Syst. Sci..

[7]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[8]  Lane A. Hemaspaandra,et al.  Theory of Semi-Feasible Algorithms , 2003, Monographs in Theoretical Computer Science An EATCS Series.

[9]  Frank Stephan,et al.  The complexity of oddan , 2000 .

[10]  W. Gasarch,et al.  Bounded Queries in Recursion Theory , 1998 .

[11]  Frank Stephan,et al.  The complexity of ODDnA , 2000, Journal of Symbolic Logic.

[12]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[13]  Michael E. Saks,et al.  Products and Help Bits in Decision Trees , 1999, SIAM J. Comput..

[14]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[15]  Hartmut Klauck,et al.  Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity , 2010, Inf. Process. Lett..

[16]  Andris Ambainis,et al.  The Communication Complexity of Enumeration, Elimination, and Selection , 2001, J. Comput. Syst. Sci..

[17]  Moni Naor,et al.  Amortized Communication Complexity , 1995, SIAM J. Comput..

[18]  Laura Bozzelli,et al.  The Complexity of  CaRet + Chop , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[19]  D. Ulig.  On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements , 1974 .

[20]  D. Sivakumar,et al.  On membership comparable sets , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[21]  Andrew Chi-Chih Yao,et al.  Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[22]  John Gill,et al.  Terse, Superterse, and Verbose Sets , 1993, Inf. Comput..

[23]  Amihood Amir,et al.  Some connections between bounded query classes and non-uniform complexity , 2000, Inf. Comput..

[24]  Ronen Shaltiel.  Towards proving strong direct product theorems , 2003, computational complexity.

[25]  Alan L. Selman,et al.  P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP , 1979, ICALP.

[26]  Avi Wigderson,et al.  A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[27]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[28]  Ran Raz,et al.  Super-logarithmic depth lower bounds via the direct sum in communication complexity , 1995, computational complexity.

[29]  Eyal Kushilevitz,et al.  Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[30]  Vikraman Arvind,et al.  Polynomial time truth-table reductions to p-selective sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[31]  Jaikumar Radhakrishnan,et al.  A Direct Sum Theorem in Communication Complexity via Message Compression , 2003, ICALP.

[32]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[33]  Xi Chen,et al.  How to Compress Interactive Communication , 2013, SIAM J. Comput..

[34]  Ran Raz,et al.  Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[35]  Russell Impagliazzo,et al.  Communication complexity towards lower bounds on circuit depth , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[36]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[37]  Ran Raz,et al.  Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.

[38]  Ran Raz,et al.  A direct product theorem , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[39]  Jin-Yi Cai,et al.  Enumerative Counting Is Hard , 1989, Inf. Comput..

[40]  Alan L. Selman,et al.  Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity , 1982, Inf. Control..

[41]  Alan L. Selman,et al.  Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[42]  Frank Stephan,et al.  Approximable sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[43]  Giulia Galbiati.  M. J. Fischer: On the Complexity of 2-Output Boolean Networks , 1981, Theor. Comput. Sci..