Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Information Processing Letters
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
A Lower Bound for Integer Multiplication with Read-Once Branching Programs
SIAM Journal on Computing
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Separating Counting Communication Complexity Classes
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Power of Polynomial Size Omega-Branching Programs
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Information Processing Letters
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Lower bounds for restricted read-once parity branching programs
Theoretical Computer Science
| Hi-index | 0.00 |
We present a new lower bound technique for a restricted Branching Program model, namely for nondeterministic graph-driven read-once Branching Programs (g.d.-BP1s). The technique is derived by drawing a connection between 驴-nondeterministic g.d.-BP1s and 驴-nondeterministic communication complexity (for the nondeterministic acceptance modes 驴 驴 {驴, 驴, 驴,}). We apply the technique in order to prove an exponential lower bound for integer multiplication for 驴-nondeterministic well-structured g.d.-BP1s. (For 驴 = 驴 an exponential lower bound was already obtained in [5] by using a different technique.) Further, we use the lower bound technique to prove for an explicitly defined fnction which can be represented by polynomial size 驴-nondeterministic BP1s that it has exponential complexity in the 驴-nondeterministic well-structured g.d.-BP1 model for 驴 驴 {驴, 驴}. This answers an open question from Brosenne, Homeister, and Waack [7], whether the nondeterministic BP1 model is in fact more powerful than the well-structured graph-driven variant.