Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference5 articles.
1. B. Bollig, N. Range, I. Wegener, Exact OBDD bounds for some fundamental functions, ECCC TR07-049, 2007
2. B. Bollig, P. Woelfel, A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing, in: Proc. of 33rd STOC, 2001, pp. 419–424
3. Optimal decision trees and one-time-only branching-programs for symmetric Boolean functions;Wegener;Information and Control,1984
4. The Complexity of Boolean Functions;Wegener,1987
5. Branching Programs and Binary Decision Diagrams—Theory and Applications;Wegener,2000
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献