Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory
Reference29 articles.
1. N. Alon, On the rigidity of Hadamard matrices, unpublished manuscript
2. B. Bollobás. Extremal graph theory, Academic Press, New York, 1978
3. B. Chazelle, A Spectral Approach to Lower Bounds, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, 674-682
4. B. Codenotti, P. Pudlák, G. Resta, Some structural properties of low rank matrices related to computational complexity, Theor. Comput. Sci., to appear
5. The smallest perturbation of a submatrix which lowers the rank and constrained total least square problems;Demmel;SIAM J. Numer. Anal.,1987
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Beyond Number of Bit Erasures;ACM SIGACT News;2018-06-13
2. Probabilistic rank and matrix rigidity;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
3. Complexity of Linear Circuits and Geometry;Foundations of Computational Mathematics;2015-04-28
4. Using Elimination Theory to Construct Rigid Matrices;computational complexity;2013-04-09
5. On a Theorem of Razborov;computational complexity;2011-10-21