Arithmetic circuits : A chasm at depth three four
暂无分享,去创建一个
[1] Avi Wigderson,et al. Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.
[2] Dan Romik,et al. Stirling's Approximation for n!: the Ultimate Short Proof? , 2000, Am. Math. Mon..
[3] Leslie G. Valiant,et al. Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..
[4] Nitin Saxena,et al. Diagonal Circuit Identity Testing and Lower Bounds , 2008, ICALP.
[5] Amir Shpilka,et al. Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[6] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[7] Ran Raz. Tensor-Rank and Lower Bounds for Arithmetic Formulas , 2013, JACM.
[8] A. Wigderson. P, N P and Mathematics – a Computational Complexity Perspective , 2022 .
[9] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[10] D. Littlewood,et al. The Theory of Group Characters and Matrix Representations of Groups , 2006 .
[11] G. Hardy,et al. Asymptotic Formulaæ in Combinatory Analysis , 1918 .
[12] R. Lathe. Phd by thesis , 1988, Nature.
[13] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[14] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[15] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[16] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[17] Guillaume Malod,et al. Characterizing Valiant's algebraic complexity classes , 2008, J. Complex..
[18] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[19] Nitin Saxena,et al. The Power of Depth 2 Circuits over Algebras , 2009, FSTTCS.
[20] Meena Mahajan,et al. Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds , 1998, Theor. Comput. Sci..
[21] Pascal Koiran,et al. Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..
[22] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.
[23] 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.
[24] Manindra Agrawal,et al. Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.
[25] Joos Heintz,et al. Testing polynomials which are easy to compute (Extended Abstract) , 1980, STOC '80.
[26] Avi Wigderson,et al. IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM , 2012, Forum of Mathematics, Sigma.
[27] M. Newman,et al. Topics in Algebra , 1978 .
[28] I. Fischer. Sums of like powers of multivariate linear forms , 1994 .
[29] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[30] W. J. Ellison. A `Waring's problem' for homogeneous forms , 1969 .