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