Arithmetic Circuits with Locally Low Algebraic Rank
暂无分享,去创建一个
[1] Amir Shpilka. Affine projections of symmetric polynomials , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[2] Ilya Volkovich,et al. Black-Box Identity Testing of Depth-4 Multilinear Circuits , 2011, Combinatorica.
[3] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[4] Ramprasad Saptharishi. Recent Progress on Arithmetic Circuit Lower Bounds , 2014, Bull. EATCS.
[5] Ran Raz. Elusive functions and lower bounds for arithmetic circuits , 2008, STOC '08.
[6] Nitin Saxena,et al. From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[7] Neeraj Kayal,et al. Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin , 2016, computational complexity.
[8] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.
[9] Neeraj Kayal,et al. Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[10] Pascal Koiran,et al. Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..
[11] Sébastien Tavenas,et al. Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..
[12] Nutan Limaye,et al. Lower bounds for depth 4 formulas computing iterated matrix multiplication , 2014, STOC.
[13] 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.
[14] 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..
[15] Zeev Dvir,et al. Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..
[16] Zeev Dvir,et al. Hardness-randomness tradeoffs for bounded depth arithmetic circuits , 2008, SIAM J. Comput..
[17] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[18] 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.
[19] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[20] Neeraj Kayal,et al. A super-polynomial lower bound for regular arithmetic formulas , 2014, STOC.
[21] Ramprasad Saptharishi,et al. An exponential lower bound for homogeneous depth-5 circuits over finite fields , 2015, Electron. Colloquium Comput. Complex..
[22] Leonard M. Adleman,et al. Finding irreducible polynomials over finite fields , 1986, STOC '86.
[23] Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..
[24] Nitin Saxena,et al. From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, FOCS.
[25] Shubhangi Saraf,et al. Sums of products of polynomials in few variables : lower bounds and polynomial identity testing , 2015, CCC.
[26] Shubhangi Saraf,et al. On the Power of Homogeneous Depth 4 Arithmetic Circuits , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[27] Amir Shpilka,et al. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[28] 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.
[29] Zeev Dvir,et al. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.
[30] Avi Wigderson,et al. Extractors And Rank Extractors For Polynomial Sources , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[31] Ilya Volkovich,et al. Improved Polynomial Identity Testing for Read-Once Formulas , 2009, APPROX-RANDOM.
[32] J. Oxley. Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .
[33] Nitin Saxena,et al. Algebraic independence and blackbox identity testing , 2013, Inf. Comput..
[34] Ilya Volkovich,et al. Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in , 2013, SIAM J. Comput..
[35] Nitin Saxena,et al. Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits , 2011, STOC '12.
[36] Amir Shpilka,et al. Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas , 2016, computational complexity.
[37] Neeraj Kayal. The Complexity of the Annihilating Polynomial , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[38] Nitin Saxena,et al. Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter , 2012, SIAM J. Comput..
[39] Shubhangi Saraf,et al. Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[40] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[41] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[42] Michael A. Forbes. Deterministic Divisibility Testing via Shifted Partial Derivatives , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.