Publisher
Springer International Publishing
Reference9 articles.
1. Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009)
2. Blum, N.: A boolean function requiring 3n network size. Theor. Comput. Sci. 28, 337–345 (1984)
3. Lecture Notes in Computer Science;E Demenkov,2011
4. Iwama, K., Morizumi, H.: An explicit lower bound of 5n - o(n) for boolean circuits. In: Proc. of MFCS, pp. 353–364 (2002)
5. Klauck, H.: Lower bounds for computation with limited nondeterminism. In: Proc. of CCC, pp. 141–152 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献