메뉴 건너뛰기




Volumn 1084, Issue , 1996, Pages 219-233

On optimizing multiplications of sparse matrices

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; MATRIX ALGEBRA;

EID: 84941997904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_17     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 1
    • 2342599088 scopus 로고
    • Estimating the size of the transitive closure in linear time
    • IEEE, full version submitted to JCSS
    • E. Cohen. Estimating the size of the transitive closure in linear time. In Proc. 35 th IEEE Annual Symposium on Foundations of Computer Science, pages 190-200. IEEE, 1994. full version submitted to JCSS.
    • (1994) Proc. 35 th IEEE Annual Symposium on Foundations of Computer Science , pp. 190-200
    • Cohen, E.1
  • 2
    • 85023205150 scopus 로고
    • Matrix multiplication via arithmetic progressions
    • D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9:251-280, 1990.
    • (1990) J. Symb. Comput , vol.9 , pp. 251-280
    • Coppersmith, D.1    Winograd, S.2
  • 5
    • 0000215640 scopus 로고
    • Predicting structure in nonsymmetric sparse matrix factorizations
    • A. George, J. Gilbert, and J.W.H. Liu, editors, Springer-Verlag
    • J. Gilbert and E. G. NG. Predicting structure in nonsymmetric sparse matrix factorizations. In A. George, J. Gilbert, and J.W.H. Liu, editors, Graph theory and sparse matrix computation The IMA volumes in Mathematics and its Applications, volume 56, pages 107-140. Springer-Verlag, 1993.
    • (1993) Graph theory and sparse matrix computation The IMA volumes in Mathematics and its Applications , vol.56 , pp. 107-140
    • Gilbert, J.1    Ng, E.G.2
  • 6
    • 0004236492 scopus 로고
    • The Johns Hopkins U. Press, Baltimore, MD
    • G. Golub. Matrix Computations. The Johns Hopkins U. Press, Baltimore, MD, 1989.
    • (1989) Matrix Computations
    • Golub, G.1
  • 9
    • 0004112038 scopus 로고
    • Addison-Wesley Publishing Co., Reading, MA
    • R. Sedgewick. Algorithms. Addison-Wesley Publishing Co., Reading, MA, 1988.
    • (1988) Algorithms
    • Sedgewick, R.1
  • 10
    • 34250487811 scopus 로고
    • Gaussian elimination is not optimal
    • V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14(3): 345-356, 1969.
    • (1969) Numerische Mathematik , vol.14 , Issue.3 , pp. 345-356
    • Strassen, V.1


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