The bit-operation complexity of matrix multiplication and of all pair shortest path problem-Reference-Cited by-同舟云学术

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

The bit-operation complexity of matrix multiplication and of all pair shortest path problem

Published:1981 Issue:5 Volume:7 Page:431-438
ISSN:0898-1221
Container-title:Computers & Mathematics with Applications
language:en
Short-container-title:Computers & Mathematics with Applications

Author:

Pan V.Ya.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation

Reference20 articles.

1. Gaussian elimination is not optimal;Strassen;Numer. Math,1969

2. Strassen's algorithm is not optimai;Pan,1978

3. O(n2.7799) complexity for matrix multiplication;Bini,1979

4. Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplication;Pan,1979

5. New fast algorithms for matrix operations;Pan;SIAM J. Comput,1980

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

1. From Circuit Complexity to Faster All-Pairs Shortest Paths;SIAM Review;2021-01

2. Faster All-Pairs Shortest Paths via Circuit Complexity;SIAM Journal on Computing;2018-01

3. Faster all-pairs shortest paths via circuit complexity;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31

4. Algebraic complexity of computing polynomial zeros;Computers & Mathematics with Applications;1987

5. Polynomial division and its computational complexity;Journal of Complexity;1986-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP