Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference10 articles.
1. On the algorithmic complexity of associative algebras;Alder;Theoret. Comput. Sci.,1981
2. A lower bound for matrix multiplication;Bshouty,1988
3. S. A. Cook, On the complexity of theorem proving procedures, in “Proceedings, 3rd Annual ACM Symposium on the Theory of Computing”, pp. 151–159.
4. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in “Proceedings, 19th Annual ACM Symposium on the Theory of Computing”, pp. 1–6.
5. Computers and Intractability;Garey,1979
Cited by
361 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献