SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Proceedings of the Royal Society of Edinburgh Section A: Mathematics

Volumn 143 A, Issue 2, 2013, Pages 351-370

Improved bound for complexity of matrix multiplication

(2) Davie, A M a Stothers, A J a

a UNIVERSITY OF EDINBURGH (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84875155079 PISSN: 03082105 EISSN: 14737124 Source Type: Journal
DOI: 10.1017/S0308210511001648 Document Type: Article

Times cited : (142)

References (17)

1
- 0001587222
- On sets of integers which contain no three terms in arithmetical progression
- F. A. Behrend. On sets of integers which contain no three terms in arithmetical progression. Proc. Natl Acad. Sci. USA 32 (1946), 331-332.
- (1946) Proc. Natl Acad. Sci. USA , vol.32 , pp. 331-332
- Behrend, F.A.¹

2
- 51249182176
- Relations between exact and approximate bilinear algorithms
- D. Bini. Relations between exact and approximate bilinear algorithms. Calcolo 17 (1980), 87-97.
- (1980) Calcolo , vol.17 , pp. 87-97
- Bini, D.¹

3
- 0038954994
- O(n2.7799) complexity for matrix multiplication
- D. Bini, M. Capovani, G. Lotti and F. Romani. O(n2.7799) complexity for matrix multiplication. Info. Process. Lett. 8 (1979), 234-235.
- (1979) Info. Process. Lett. , vol.8 , pp. 234-235
- Bini, D.¹ Capovani, M.² Lotti, G.³ Romani, F.⁴

4
- 0033325491
- A 52 n2 lower bound for the rank of n × n matrix multiplication over arbitrary fields
- (New York: IEEE)
- M. Bläser. A 52 n2 lower bound for the rank of n × n matrix multiplication over arbitrary fields. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 45-50 (New York: IEEE, 1999).
- (1999) Proceedings of the 40th Annual Symposium on Foundations of Computer Science , pp. 45-50
- Bläser, M.¹

5
- 0000817992
- Algebraic complexity theory
- Springer
- P.Bürgisser, M. Clausen and M. A. Shokrollahi. Algebraic complexity theory, Comprehensive Studies in Mathematics, volume 315 (Springer, 1997).
- (1997) Comprehensive Studies in Mathematics , vol.315
- Bürgisser, P.¹ Clausen, M.² Shokrollahi, M.A.³

6
- 0010999635
- On the asymptotic complexity of matrix multiplication
- D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplication. SIAM J. Comput. 11 (1982), 472-492.
- (1982) SIAM J. Comput. , vol.11 , pp. 472-492
- Coppersmith, D.¹ Winograd, S.²

7
- 85023205150
- Matrix multiplication via arithmetic progressions
- D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Computat. 9 (1990), 251-280.
- (1990) J. Symb. Computat. , vol.9 , pp. 251-280
- Coppersmith, D.¹ Winograd, S.²

8
- 84904297521
- Strassen's algorithm is not optimal: Trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
- New York: IEEE
- V. Pan. Strassen's algorithm is not optimal: trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 166-176 (New York: IEEE, 1978).
- (1978) Proceedings of the 19th Annual Symposium on Foundations of Computer Science , pp. 166-176
- Pan, V.¹

9
- 0008201375
- New fast algorithms for matrix operations
- V. Pan. New fast algorithms for matrix operations. SIAM J. Comput. 9 (1980), 321-342.
- (1980) SIAM J. Comput. , vol.9 , pp. 321-342
- Pan, V.¹

10
- 2142828233
- New combinations of methods for the acceleration of matrix multiplication
- V. Pan. New combinations of methods for the acceleration of matrix multiplication. Comput. Math. Appl. 7 (1981), 73-125.
- (1981) Comput. Math. Appl. , vol.7 , pp. 73-125
- Pan, V.¹

11
- 0021452919
- How can we speed up matrix multiplication?
- V. Pan. How can we speed up matrix multiplication? SIAM Rev. 26 (1984), 393-415.
- (1984) SIAM Rev. , vol.26 , pp. 393-415
- Pan, V.¹

12
- 79959681041
- Some properties of disjoint sums of tensors related to matrix multiplication
- F. Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput. 11 (1982), 263-267.
- (1982) SIAM J. Comput. , vol.11 , pp. 263-267
- Romani, F.¹

13
- 0011047766
- On sets of integers which contain no three terms in arithmetical progression
- R. Salem and D. C. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. Natl Acad. Sci. USA 28 (1942), 561-563.
- (1942) Proc. Natl Acad. Sci. USA , vol.28 , pp. 561-563
- Salem, R.¹ Spencer, D.C.²

14
- 0013069009
- Partial and total matrix multiplication
- A. Schönhage. Partial and total matrix multiplication. SIAM J. Comput. 10 (1981), 434-455.
- (1981) SIAM J. Comput. , vol.10 , pp. 434-455
- Schönhage, A.¹

15
- 84863110607
- Doctoral Thesis, University of Edinburgh
- A. Stothers. On the complexity of matrix multiplication. Doctoral Thesis, University of Edinburgh (2010).
- (2010) On the Complexity of Matrix Multiplication
- Stothers, A.¹

16
- 34250487811
- Gaussian elimination is not optimal
- V. Strassen. Gaussian elimination is not optimal. Numer. Math. 13 (1969), 354-356.
- (1969) Numer. Math. , vol.13 , pp. 354-356
- Strassen, V.¹

17
- 84943702783
- Relative bilinear complexity and matrix multiplication
- V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math. 375 (1987), 406-443.
- (1987) J. Reine Angew. Math. , vol.375 , pp. 406-443
- Strassen, V.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.