Information transfer under different sets of protocols
SIAM Journal on Computing
Handbook of theoretical computer science (vol. A)
SIAM Journal on Computing
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Results on communication complexity classes
Journal of Computer and System Sciences
Communication complexity
On P versus NP CO-NP for decision trees and read-once branching programs
Computational Complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
On multi-partition communication complexity
Information and Computation
| Hi-index | 0.89 |
We consider the analog of the P versus NP ∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬ f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication complexity? In the fixed (worst) partition model of communication this question was answered by Aho, Ullman and Yannakakis in 1983: here P = NP ∩ co-NP.We show that in the best partition model of communication the situation is entirely different: here P is a proper subset even of RP ∩ co-RP. This, in particular, resolves an open question raised by Papadimitriou and Sipser in 1982.