The complexity of Boolean functions
The complexity of Boolean functions
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
Lower bounds for depth-restricted branching programs
Information and Computation
On oblivious branching programs of linear length
Information and Computation
Private vs. common random bits in communication complexity
Information Processing Letters
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
On the power of multiple reads in a chip
Information and Computation
Information Processing Letters
A communication-randomness tradeoff for two-processor systems
Information and Computation
Bounds on tradeoffs between randomness and communication complexity
Computational Complexity
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth 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
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Lower bounds on information transfer in distributed computations
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference 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
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
In this paper, lower bound and tradeoff results relating the computational power of determinism, nondeterminism, and randomness for communication protocols and branching programs are presented. The main results can be divided into the following three groups. (i) One of the few major open problems concerning nondeterministic communication complexity is to prove an asymptotically exact tradeoff between complexity and the number of available advice bits. This problem is solved here for the case of one-way communication. (ii) Multipartition protocols are introduced as a new type of communication protocols using a restricted form of non-obliviousness. In order to be able to study methods for proving lower bounds on multilective and/or non-oblivious computation, these protocols are allowed to either deterministically or nondeterministically choose between different partitions of the input. Here, the first results showing the potential increase of the computational power by nonobliviousness as well as boundaries on this power are derived. (iii) The above results (and others) are applied to obtain several new exponential lower bounds for different types of oblivious branching programs, which also yields new insights into the power of nondeterminism and randomness for the considered models. The proofs rely on a general technique described here which allows to prove explicit lower bounds on the size of oblivious branching programs in an easy and transparent way.