Using fast matrix multiplication to find basic solutions

Theoretical Computer Science

Volumn 205, Issue 1-2, 1998, Pages 307-316

  Beling, Peter A ^a   Megiddo, Nimrod ^b,c  

^a University of Virginia   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038954995     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00003-6     Document Type: Article

References (10)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. D. Coppersmith, Rapid multiplication of rectangular matrices, SIAM J. Comput. 11 (1982) 467-471.
3. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computat. 9 (1990) 251-280.
4. G. Golub, C. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, 1989.
5. W. Marlow, Mathematics for Operations Research, Wiley, New York, 1978.
6. N. Megiddo, On finding primal- and dual-optimal bases, ORSA J. Comput. 3 (1991) 63-65.
7. V. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science, vol. 179, Springer, Berlin, 1984.
8. P. Vaidya, Speeding-up linear programming using fast matrix multiplication, in: Proc. FOCS'89, IEEE, Los Angeles, 1989, pp. 332-337.
9. S. Winograd, Arithmetic Complexity of Computations, SIAM, Philadelphia, 1980.
10. S. Winograd, Algebraic complexity theory, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Elsevier, Amsterdam, 1990, pp. 633-672.