Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Quantum and Approximate Privacy
STACS '02 Proceedings of the 19th 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
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Computational Complexity
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Unbounded-error classical and quantum communication complexity
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
ACM SIGACT News
SIAM Journal on Computing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
A little advice can be very helpful
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On black-box reductions between predicate encryption schemes
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Implausible consequences of superstrong nonlocality
Natural Computing: an international journal
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multiparty communication complexity of vector---valued and sum---type functions
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity classes is introduced. Besides providing a more structured approach to the complexity of a variety of concrete problems of interest to VLSI, the main objective is to exploit the analogy between Turing machine (TM) and communication complexity (CC) classes. The latter provide a more amicable environment for the study of questions analogous to the most notorious problems in TM complexity. Implicitly, CC classes corresponding to P, NP, coNP, BPP and PP have previously been considered. Surprisingly, pcc = Npcc ∩ coNPcc is known [AUY]. We develop the definitions of PSPACEcc and of the polynomial time hierarchy in CC. Notions of reducibility are introduced and a natural complete member in each class is found. BPPcc ⊆ Σ2cc ∩ Π2cc [Si2] remains valid. We solve the question that BPPcc ⊉ NPcc by proving an Ω(√n) lower bound for the bounded-error complexity of the coNPcc- complete problem "disjointness". Similar lower bounds follow for essentially any nontrivial monotone graph property. Another consequence is that the deterministically exponentially hard "equality" relation is not NPcc-hard with respect to oracle-protocol reductions. We prove that the distributional complexity of the disjointness problem is O(√n log n) under any product measure on {0, 1}n 脳 {0, 1}n. This points to the difficulty of improving the Ω(√n) lower bound for the B2PP complexity of "disjointness". The variety of counting and probabilistic classes appears to be greater than in the Turing machine versions. Many of the simplest graph problems (undirected reachability, planarity, bipartiteness, 2-CNF-satisfiability) turn out to be PSPACEcc-hard. The main open problem remains the separation of the hierarchy, more specifically, the conjecture that Σ2cc ≠ Π2cc. Another major problem is to show that PSPACEcc and the probabilistic class UPPcc are not comparable.