Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference17 articles.
1. Ablayev, F.M., Khadiev, K.R.: Extension of the hierarchy for k-obdds of small width. Russ. Math. Surv. 57(3), 46–50 (2013)
2. Alon, N., Maass, W.: Meanders and their applications in lower bounds arguments. J. Comput. Syst. Sci. 37(2), 118–129 (1988)
3. Bollig, B., Sauerhoff, M., Sieling, D., Wegener, I.: Hierarchy theorems for kobdds and kibdds. Theor. Comput. Sci. 205(1-2), 45–60 (1998)
4. Borodin, A., Razborov, A.A., Smolensky, R.: On lower bounds for read-k-times branching programs. Comput. Complex. 3, 1–18 (1993)
5. Bova, S., Capelli, F., Mengel, S., Slivovsky, F.: Expander cnfs have exponential DNNF size. CoRR, arXiv: 1411.1995 (2014)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献