Author:
Mahajan Meena,Saurabh Nitin
Publisher
Springer International Publishing
Reference28 articles.
1. Alon, N., Boppana, R.B.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1–22 (1987)
2. Lecture Notes in Computer Science;D Avis,2013
3. Algorithms and Computation in Mathematics;P Bürgisser,2000
4. Bürgisser, P.: On the structure of Valiant’s complexity classes. Discrete Math. Theor. Comput. Sci. 3(3), 73–94 (1999)
5. Bürgisser, P.: Cook’s versus Valiant’s hypothesis. Theor. Comput. Sci. 235(1), 71–88 (2000)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献