Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin
暂无分享,去创建一个
[1] Neeraj Kayal,et al. A super-polynomial lower bound for regular arithmetic formulas , 2014, STOC.
[2] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.
[3] Amit Chakrabarti,et al. A Depth-Five Lower Bound for Iterated Matrix Multiplication , 2015, Computational Complexity Conference.
[4] Noga Alon,et al. Perturbed Identity Matrices Have High Rank: Proof and Applications , 2009, Combinatorics, Probability and Computing.
[5] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[6] Alexander A. Razborov,et al. Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields , 2000, Applicable Algebra in Engineering, Communication and Computing.
[7] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[8] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[9] D. Littlewood,et al. The Theory of Group Characters and Matrix Representations of Groups , 2006 .
[10] Nutan Limaye,et al. Lower bounds for depth 4 formulas computing iterated matrix multiplication , 2014, STOC.
[11] Nilson C. Bernardes. ON Sums of Products of Polynomials , 1998 .
[12] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[13] Pascal Koiran,et al. Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..
[14] 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.
[15] Neeraj Kayal,et al. Lower Bounds for Sums of Products of Low arity Polynomials , 2015, Electron. Colloquium Comput. Complex..
[16] Avi Wigderson,et al. Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[17] Sébastien Tavenas,et al. Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..
[18] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.
[19] Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..
[20] G. Hardy,et al. Asymptotic Formulaæ in Combinatory Analysis , 1918 .
[21] Shubhangi Saraf,et al. Sums of products of polynomials in few variables : lower bounds and polynomial identity testing , 2015, CCC.
[22] Shubhangi Saraf,et al. On the Power of Homogeneous Depth 4 Arithmetic Circuits , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[23] Shubhangi Saraf,et al. Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits , 2014, ICALP.
[24] Nutan Limaye,et al. Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas , 2014, STOC.
[25] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[26] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[27] G. Hardy,et al. Asymptotic formulae in combinatory analysis , 1918 .
[28] Neeraj Kayal,et al. Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.