Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Meanders and their applications in lower bounds arguments
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Private vs. common random bits in communication complexity
Information Processing Letters
A communication-randomness tradeoff for two-processor systems
Information and Computation
On lower bounds for read-k-times branching programs
Computational Complexity
Bounds on tradeoffs between randomness and communication complexity
Computational Complexity
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Neither reading few bits twice nor reading illegally helps much
Discrete Applied Mathematics
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
| Hi-index | 0.00 |
We study k-partition communication protocols, an extension of the standard two-party best-partition model to k input partitions. The main results are as follows. 1. A strong explicit hierarchy on the degree of non-obliviousness is established by proving that, using k + 1 partitions instead of k may decrease the communication complexity from Θ (n) to Θ(log k). 2. Certain linear codes are hard for k-partition protocols even when k may be exponentially large (in the input size). On the other hand, one can show that all characteristic functions of linear codes are easy for randomized OBDDs. 3. It is proved that there are subfunctions of the triangle-freeness function and the function ⊕ CLIQUE3,n that are hard for multi-partition protocols. As an application, strongly exponential lower bounds on the size of nondeterministic read-once branching programs for these functions are obtained, solving an open problem of Razborov [Proceedings of the eighth FCT, LNCS 529, Springer, 1991, pp. 47-60].