On separating the read-k-times branching program hierarchy

[1]  Marek Karpinski,et al.  On the Power of Randomized Branching Programs , 1996, ICALP.

[2]  Elizaveta A. Okol'nishnikova.  On the Hierarchy of Nondeterministic Branching k-Programs , 1997, FCT.

[3]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[4]  Farid M. Ablayev.  Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs , 1997, ICALP.

[5]  Noam Nisan,et al.  The computational complexity of universal hashing , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[6]  T. S. Jayram.  On separating the read-k-times branching program hierarchy , 1998, STOC '98.

[7]  Lance Fortnow.  Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[8]  Martin Sauerhoff.  A Lower Bound for Randomized Read-k-Times Branching Programs , 1997, Electron. Colloquium Comput. Complex..

[9]  Janos Simon,et al.  A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications , 1992, Advances In Computational Complexity Theory.

[10]  Martin Sauerhoff,et al.  Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract) , 1998, STACS.

[11]  Alexander A. Razborov,et al.  Lower Bounds for Deterministic and Nondeterministic Branching Programs , 1991, FCT.

[12]  Christoph Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.

[13]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Allan Borodin,et al.  Time Space Tradeoffs (Getting Closer to the Barrier?) , 1993, ISAAC.

[15]  Martin Sauerhoff.  On Nondeterminism versus Randomness for Read-Once Branching Programs , 1997, Electron. Colloquium Comput. Complex..

[16]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[17]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[18]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[19]  Stephen Ponzio,et al.  Restricted branching programs and hardware verification , 1995 .

[20]  Ingo Wegener,et al.  Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..