Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
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
On P versus NP CO-NP for decision trees and read-once branching programs
Computational Complexity
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Comparison of Free BDDs and Transformed BDDs
Formal Methods in System Design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
BDD-Based Cryptanalysis of Keystream Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
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
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference 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
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.89 |
Branching programs are a well-established computation model for Boolean functions, especially read-once branching programs (BP1s) have been studied intensively. A very simple function f in n2 variables is exhibited such that both the function f and its negation ¬ f can be computed by Σ3p-circuits, the function f has nondeterministic BP1s (with one nondeterministic node) of linear size and ¬ f has size O(n4) for oblivious nondeterministic BP1s but f requires nondeterministic graph-driven BP1s of size 2Ω(n). This answers an open question stated by Jukna, Razborov, Savický, and Wegener [Comput. Complexity 8 (1999) 357-370].