The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Efficient data structures for Boolean functions
Discrete Mathematics - Special issue: trends in discrete mathematics
On lower bounds for read-k-times branching programs
Computational Complexity
A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Restricted branching programs and hardware verification
Restricted branching programs and hardware verification
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
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
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
On Computational Power of Quantum Branching Programs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Separation of the monotone NC hierarchy
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
| Hi-index | 0.00 |
We present a survey of the communication point of view for a complexity lower bounds proof technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching programs.