On the Power of Homogeneous Depth 4 Arithmetic Circuits
暂无分享,去创建一个
[1] Nutan Limaye,et al. Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas , 2014, STOC.
[2] Partha Mukhopadhyay,et al. Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach , 2014, STACS.
[3] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[4] Pascal Koiran,et al. Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..
[5] Neeraj Kayal,et al. A super-polynomial lower bound for regular arithmetic formulas , 2014, STOC.
[6] Shubhangi Saraf,et al. The limits of depth reduction for arithmetic formulas: it's all about the top fan-in , 2013, Electron. Colloquium Comput. Complex..
[7] Shubhangi Saraf,et al. Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits , 2014, ICALP.
[8] Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..
[9] Nutan Limaye,et al. An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[10] Partha Mukhopadhyay,et al. On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields , 2014, MFCS.
[11] Ran Raz. Elusive functions and lower bounds for arithmetic circuits , 2008, STOC '08.
[12] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[13] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[14] Sébastien Tavenas,et al. Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..
[15] V. Strassen. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .
[16] Leslie G. Valiant,et al. Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..
[17] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[18] Nutan Limaye,et al. Lower bounds for depth 4 formulas computing iterated matrix multiplication , 2014, STOC.
[19] Walter Baur,et al. The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..
[20] Alexander A. Razborov,et al. Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[21] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[22] Neeraj Kayal,et al. Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.