On identity testing of tensors, low-rank recovery and compressed sensing
暂无分享,去创建一个
[1] David P. Dobkin,et al. An Improved Lower Bound on Polynomial Multiplication , 1980, IEEE Transactions on Computers.
[2] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[3] Johan Håstad,et al. Tensor Rank is NP-Complete , 1989, ICALP.
[4] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[5] Nitin Saxena,et al. Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter , 2010, STOC '11.
[6] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[7] Ron M. Roth,et al. Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.
[8] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[9] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[10] Philippe Delsarte,et al. Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.
[11] Neal Zierler,et al. Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect , 1960, Inf. Control..
[12] Joos Heintz,et al. Testing polynomials which are easy to compute (Extended Abstract) , 1980, STOC '80.
[13] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[14] Emmanuel J. Candès,et al. Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements , 2011, IEEE Transactions on Information Theory.
[15] Stephen Becker,et al. Quantum state tomography via compressed sensing. , 2009, Physical review letters.
[16] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[17] Vincent Y. F. Tan,et al. Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations , 2011, IEEE Transactions on Information Theory.
[18] Ron M. Roth. Tensor codes for the rank metric , 1996, IEEE Trans. Inf. Theory.
[19] Boris Alexeev,et al. Tensor Rank: Some Lower and Upper Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[20] Victor Shoup,et al. A computational introduction to number theory and algebra , 2005 .
[21] Amir Shpilka,et al. Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in , 2007, Electron. Colloquium Comput. Complex..
[22] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[23] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[24] David P. Woodruff,et al. On the Power of Adaptivity in Sparse Recovery , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[25] Babak Hassibi,et al. Subspace expanders and matrix rank minimization , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[26] Emmanuel J. Candès,et al. On the Fundamental Limits of Adaptive Sensing , 2011, IEEE Transactions on Information Theory.
[27] Zeev Dvir,et al. Towards Dimension Expanders over Finite Fields , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[28] Manindra Agrawal,et al. Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.
[29] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[30] Adam R. Klivans,et al. Learning Restricted Models of Arithmetic Circuits , 2006, Theory Comput..
[31] Ran Raz,et al. Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[32] Olgica Milenkovic,et al. Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[33] J. R. Cruz,et al. A novel interpretation of Prony's method , 1988 .
[34] Eyal Kushilevitz,et al. Learning functions represented as multiplicity automata , 2000, JACM.
[35] Daniel A. Spielman,et al. Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.
[36] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[37] Ran Raz,et al. Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[38] 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.
[39] A. Lubotzky,et al. Dimension expanders , 2008, 0804.0481.
[40] Roy Meshulam,et al. Spaces of Hankel matrices over finite fields , 1995 .
[41] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[42] Nader H. Bshouty,et al. Learning Multivariate Polynomials from Substitution and Equivalence Queries , 1996, Electron. Colloquium Comput. Complex..
[43] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[44] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[45] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.