Author:
Bollig Beate,Löbbing Martin,Sauerhoff Martin,Wegener Ingo
Subject
Computer Science Applications,General Mathematics,Software
Reference26 articles.
1. M. Agrawal and T. Thierauf, The satisfiability problem for probabilistic ordered branching programs, inProc. 13th IEEE Conf. on Computational Complexity(1998) 81-90.
2. Lower bounds to the complexity of symmetric Boolean functions
3. On the Relation Between BDDs and FDDs
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献