Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Lect Notes Comput Sci;F. Ablayev,1997
2. Lect Notes Comput Sci;F. Ablayev,1996
3. F. Ablayev and M. Karpinski. On the power of randomized ordered branching programs. TR98-004, Electr. Coll. on Computational Complexity, 1998.
4. M. Agrawal and T. Thierauf. The satisfiability problem for probabilistic ordered branching programs. In Proc. of the 13th IEEE Int. Conf. on Computational Complexity, 81–90, 1998.
5. B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener. Hierarchy theorems for kOBDDs and kIBDDs. Theoretical Computer Science, 205(1):45–60, 1998.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献