Lower Bounds for Matrix Factorization-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Lower Bounds for Matrix Factorization

Published:2021-04-02 Issue:1 Volume:30 Page:
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Volk Ben Lee,Kumar Mrinal

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-021-00205-2.pdf

Reference64 articles.

1. Manindra Agrawal (2005). Proving Lower Bounds Via Pseudo-random Generators. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005),, 92–105. URL https://doi.org/10.1007/11590156_6

2. Manindra Agrawal, Rohit Gurjar, Arpita Korwar & Nitin Saxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3), 669–697. URL https://doi.org/10.1137/140975103

3. Manindra Agrawal & V. Vinay (2008). Arithmetic Circuits: A Chasm at Depth Four. In Proceedings of the 49th Annual IEEE Symposium

4. on Foundations of Computer Science (FOCS 2008),, 67-75. URL https://doi.org/10.1109/FOCS.2008.32

5. Josh Alman & Lijie Chen (2019). Efficient Construction of Rigid Matrices Using an NP Oracle. InProceedings of the 60th Annual IEEE

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

1. Kronecker products, low-depth circuits, and matrix rigidity;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3