Quadratic Lower Bounds on Matrix Rigidity-Reference-Cited by-同舟云学术

Quadratic Lower Bounds on Matrix Rigidity

Published:2006 Issue: Volume: Page:295-307
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lokam Satyanarayana V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11750321_28.pdf

Reference20 articles.

1. Prelim. version 2. Dept. Computer Science;L. Babai,1992

2. Baur, W.: Simplified Lower Bounds for Polynomials with Algebraic Coefficients. Journal of Complexity 13, 38–41 (1997)

3. Besicovitch, A.S.: On the linear independence of fractional powers of integers. J. London Math. Soc. 15, 3–6 (1940)

4. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315. Springer, Heidelberg (1997)

5. Cheraghchi, M.: On Matrix Rigidity and the Complexity of Linear Forms. Electronic Colloquium on Computational Complexity (ECCC) Report CCC TR05-070 (July 2005), Available at http://eccc.uni-trier.de/eccc-reports/2005/TR05-070/index.html

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications;Journal of the ACM;2023-11-30

2. New applications of the polynomial method: The cap set conjecture and beyond;Bulletin of the American Mathematical Society;2018-10-01

3. Probabilistic rank and matrix rigidity;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19

4. Using Elimination Theory to Construct Rigid Matrices;computational complexity;2013-04-09

5. On a Theorem of Razborov;computational complexity;2011-10-21