Barriers for Rank Methods in Arithmetic Complexity
暂无分享,去创建一个
Avi Wigderson | Ankit Garg | Klim Efremenko | Rafael Mendes de Oliveira | A. Wigderson | A. Garg | R. Oliveira | K. Efremenko
[1] Michael E. Saks,et al. Towards an algebraic natural proofs barrier via polynomial identity testing , 2017, Electron. Colloquium Comput. Complex..
[2] Ran Raz. Tensor-Rank and Lower Bounds for Arithmetic Formulas , 2013, JACM.
[3] Shubhangi Saraf,et al. Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits , 2014, ICALP.
[4] J. Sylvester,et al. LX. On a remarkable discovery in the theory of canonical forms and of hyperdeterminants , 1851 .
[5] Avi Wigderson,et al. Non-commutative circuits and the sum-of-squares problem , 2010, STOC '10.
[6] Avi Wigderson,et al. Partial Derivatives in Arithmetic Complexity and Beyond , 2011, Found. Trends Theor. Comput. Sci..
[7] Nutan Limaye,et al. Lower bounds for depth 4 formulas computing iterated matrix multiplication , 2014, STOC.
[8] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[9] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[10] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[11] J. M. Landsberg. Nontriviality of equations and explicit tensors in Cm⊗Cm⊗Cm of border rank at least 2m−2 , 2015 .
[12] Neeraj Kayal,et al. An almost Cubic Lower Bound for Depth Three Arithmetic Circuits , 2016, Electron. Colloquium Comput. Complex..
[13] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[14] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[15] Amir Shpilka,et al. Succinct hitting sets and barriers to proving algebraic circuits lower bounds , 2017, STOC.
[16] Avi Wigderson,et al. Algebrization: A New Barrier in Complexity Theory , 2009, TOCT.
[17] Toniann Pitassi,et al. Exponential Lower Bounds for Monotone Span Programs , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[18] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[19] Enrico Carlini,et al. The solution to the Waring problem for monomials and the sum of coprime monomials , 2012 .
[20] Johan Håstad,et al. Tensor Rank is NP-Complete , 1989, ICALP.
[21] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.
[22] Ramprasad Saptharishi,et al. An exponential lower bound for homogeneous depth-5 circuits over finite fields , 2015, Electron. Colloquium Comput. Complex..
[23] A GrochowJoshua. Unifying Known Lower Bounds via Geometric Complexity Theory , 2015 .
[24] Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..
[25] C. D. Boor,et al. Polynomial interpolation in several variables , 1994 .
[26] Aaron Potechin. A Note on Amortized Branching Program Complexity , 2017, Computational Complexity Conference.
[27] Peter Bürgisser,et al. Completeness and Reduction in Algebraic Complexity Theory , 2000, Algorithms and computation in mathematics.
[28] Peter Bürgisser,et al. Geometric complexity theory and tensor rank , 2010, STOC '11.
[29] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[30] Laurent Hyafil,et al. On the parallel evaluation of multivariate polynomials , 1978, SIAM J. Comput..
[31] Alexander A. Razborov,et al. Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..
[32] J. M. Landsberg,et al. New Lower Bounds for the Border Rank of Matrix Multiplication , 2011, Theory Comput..
[33] Sham M. Kakade,et al. Learning mixtures of spherical gaussians: moment methods and spectral decompositions , 2012, ITCS '13.
[34] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[35] J. M. Landsberg,et al. Explicit polynomial sequences with maximal spaces of partial derivatives and a question of K. Mulmuley , 2017, Theory Comput..
[36] J. M. Landsberg,et al. Geometry and Complexity Theory , 2017 .
[37] Ramprasad Saptharishi,et al. Hitting sets for multilinear read-once algebraic branching programs, in any order , 2014, STOC.
[38] Tomas Sauer,et al. Polynomial interpolation in several variables , 2000, Adv. Comput. Math..
[39] A. Razborov. On submodular complexity measures , 1992 .
[40] Noam Nisan,et al. Lower bounds for non-commutative computation , 1991, STOC '91.
[41] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..
[42] Anima Anandkumar,et al. A Spectral Algorithm for Latent Dirichlet Allocation , 2012, Algorithmica.
[43] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[44] Joseph T. Chang,et al. Full reconstruction of Markov models on evolutionary trees: identifiability and consistency. , 1996, Mathematical biosciences.
[45] Alexander A. Razborov,et al. On the method of approximations , 1989, STOC '89.
[46] A. Wigderson,et al. C C ] 2 6 O ct 2 01 7 Barriers for Rank Methods in Arithmetic Complexity , 2018 .
[47] Tengyu Ma,et al. On the optimization landscape of tensor decompositions , 2017, Mathematical Programming.
[48] Nutan Limaye,et al. Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas , 2014, STOC.
[49] Boris Alexeev,et al. Tensor Rank: Some Lower and Upper Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[50] Elchanan Mossel,et al. Learning nonsingular phylogenies and hidden Markov models , 2005, STOC '05.
[51] R. Smolensky. On representations by low-degree polynomials , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[52] Harm Derksen,et al. On non-commutative rank and tensor rank , 2016, 1606.06701.
[53] Aaron Potechin. A Note on Amortized Space Complexity , 2016, ArXiv.
[54] Neeraj Kayal,et al. Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.