메뉴 건너뛰기




Volumn 8, Issue 3, 1999, Pages 203-226

Lower bounds for the multiplicative complexity of matrix multiplication

Author keywords

Lower bound; Matrix multiplication; Multiplicative complexity; Substitution method

Indexed keywords


EID: 0040531570     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050028     Document Type: Article
Times cited : (23)

References (13)
  • 1
    • 0001245248 scopus 로고
    • On the algorithmic complexity of associative algebras, theoret
    • A. ALDER AND V. STRASSEN, On the algorithmic complexity of associative algebras, Theoret. Comput. Sci. 15 (1981), 201-211.
    • (1981) Comput. Sci. , vol.15 , pp. 201-211
    • Alder, A.1    Strassen, V.2
  • 2
    • 0002125925 scopus 로고
    • On the optimal evaluation of a set of bilinear forms
    • R. W. BROCKETT AND D. DOBKIN, On the optimal evaluation of a set of bilinear forms, Linear Algebra and Appl. 19 (1978), 207-235.
    • (1978) Linear Algebra and Appl. , vol.19 , pp. 207-235
    • Brockett, R.W.1    Dobkin, D.2
  • 4
    • 0013166688 scopus 로고
    • On the varieties of optimal algorithms for the computation of bilinear mappings: The isotropy group of a bilinear mapping
    • H. F. DE GROOTE, On the varieties of optimal algorithms for the computation of bilinear mappings: The isotropy group of a bilinear mapping, Theoret. Comput. Sci. 7 (1978), 1-24.
    • (1978) Theoret. Comput. Sci. , vol.7 , pp. 1-24
    • De Groote, H.F.1
  • 6
    • 0014972944 scopus 로고
    • On minimizing the number of multiplications necessary for matrix multiplication
    • J. HOPCROFT AND L. KERR, On minimizing the number of multiplications necessary for matrix multiplication, SIAM J. Appl. Math. 20 (1971), 20-36.
    • (1971) SIAM J. Appl. Math. , vol.20 , pp. 20-36
    • Hopcroft, J.1    Kerr, L.2
  • 7
    • 0040597497 scopus 로고
    • On the complexity of bilinear forms with commutativity
    • J. JA'JA', On the complexity of bilinear forms with commutativity, SIAM J. Comput. 9 (1980), 717-738.
    • (1980) SIAM J. Comput. , vol.9 , pp. 717-738
    • Ja'ja', J.1
  • 9
    • 0000238829 scopus 로고
    • Methods for computing values of polynomials
    • V. PAN, Methods for computing values of polynomials, Russ. Math. Surv. 21 (1966), 105-136.
    • (1966) Russ. Math. Surv. , vol.21 , pp. 105-136
    • Pan, V.1
  • 11
    • 34250487811 scopus 로고
    • Gaussian elimination is not optimal, num
    • V. STRASSEN, Gaussian elimination is not optimal, Num. Math. 13 (1969), 354-356.
    • (1969) Math. , vol.13 , pp. 354-356
    • Strassen, V.1
  • 12
    • 84961475121 scopus 로고
    • Vermeidung von divisionen
    • V. STRASSEN, Vermeidung von Divisionen, J. Reine Angew. Math. 264 (1973), 184-202.
    • (1973) J. Reine Angew. Math. , vol.264 , pp. 184-202
    • Strassen, V.1
  • 13
    • 0001052336 scopus 로고
    • Algebraic complexity theory
    • J. van Leeuven, ed., Elsevier Science Publishers B.V.
    • V. STRASSEN, Algebraic complexity theory, in Handbook of Theoretical Computer Science Vol. A, J. van Leeuven, ed., Elsevier Science Publishers B.V., 1990, 634-672.
    • (1990) Handbook of Theoretical Computer Science , vol.A , pp. 634-672
    • Strassen, V.1


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