Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance

Ordered binary decision diagrams with repeated tests are considered both in complexity theory and in applications. Bollig et al. have proved in [B. Bollig, M. Sauerhoff, D. Sieling, I. Wegener, Hierarchy theorems of kOBDDs and kIBDDs, Theoret. Comput. Sci. 205 (1998) 45-60] a tight hierarchy result for the classes of functions representable by k layers of polynomial-size deterministic ordered binary decision diagrams. In this paper the nondeterministic case is investigated, where the layers are driven by one and the same variable ordering. For k being a constant, it is shown that for the existential, the parity-, and the majority acceptance mode the analogous hierarchy collapses.

[1]  I. Wegener.  Branching Programs and Binary Deci-sion Diagrams-Theory and Applications , 1987 .

[2]  Jacob A. Abraham,et al.  Efficient algorithmic circuit verification using indexed BDDs , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

[3]  Matthias Krause,et al.  On Oblivious Branching Programs of Linear Length , 1991, Inf. Comput..

[4]  Juraj Hromkovic,et al.  The Power of Nondeterminism and Randomness for Oblivious Branching Programs , 2002, Theory of Computing Systems.

[5]  Matthias Krause.  Lower Bounds for Depth-Restricted Branching Programs , 1991, Inf. Comput..

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

[7]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[8]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[9]  Beate Bollig,et al.  Hierarchy Theorems for kOBDDs and kIBDDs , 1998, Theor. Comput. Sci..

[10]  Noam Nisan,et al.  Rounds in Communication Complexity Revisited , 1993, SIAM J. Comput..

[11]  Stephan Waack,et al.  Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs , 2003, MFCS.

[12]  Jacob A. Abraham,et al.  IBDDs: an efficient functional representation for digital circuits , 1992, [1992] Proceedings The European Conference on Design Automation.

[13]  Noga Alon,et al.  Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

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

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

[16]  Christoph Meinel,et al.  On relations between counting communication complexity classes , 2004, J. Comput. Syst. Sci..