Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Time-Space trade-offs for branching programs
Journal of Computer and System Sciences
More on the complexity of slice functions
Theoretical Computer Science
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The Complexity of Computing
A Lower Bound on Complexity of Branching Programs (Extended Abstract)
Proceedings of the Mathematical Foundations of Computer Science 1984
Lower bounds on the complexity of 1-time only branching programs
FCT '85 Fundamentals of Computation Theory
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Bounds for width two branching programs
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Exponential lower bounds for restricted monotone circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
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
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of minimizing and learning OBDDs and FBDDs
Discrete Applied Mathematics
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Optimal Free Binary Decision Diagrams for Computation of EARn
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Almost k-wise independence and hard Boolean functions
Theoretical Computer Science - Latin American theoretical informatics
Information and Computation - Special issue: LICS'97
How many decomposition types do we need? [decision diagrams]
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Free binary decision diagrams for the computation of EARn
Computational Complexity
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
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
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On Average Time Complexity of Decision Trees and Branching Programs
Fundamenta Informaticae
| Hi-index | 0.01 |
Exponential lower bounds on the complexity of computing the clique functions in the Boolean decision-tree model are proved. For one-time-only branching programs, large polynomial lower bounds are proved for k-clique functions if k is fixed, and exponential lower bounds if k increases with n. Finally, the hierarchy of the classes BPd(P) of all sequences of Boolean functions that may be computed by d-times only branching programs of polynomial size is introduced. It is shown constructively that BP1(P) is a proper subset of BP2(P).