Using Fast Matrix Multiplication to Find Basic Solutions

[1]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[2]  Nimrod Megiddo,et al.  On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..

[3]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[4]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[5]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[7]  Victor Y. Pan,et al.  How to Multiply Matrices Faster , 1984, Lecture Notes in Computer Science.

[8]  Don Coppersmith.  Rapid Multiplication of Rectangular Matrices , 1982, SIAM J. Comput..

[9]  S. Winograd.  Arithmetic complexity of computations , 1980 .

[10]  Robert M Thrall,et al.  Mathematics of Operations Research. , 1978 .

[11]  A. D. Young.  Mathematics for Operations Research , 1978 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .