1. C.C. Gonzaga, “An algorithm for solving linear programming problems in O(n 3 L) operations,” Memorandum Number UCB/ERL M87/10, Electronics Research Laboratory, University of California (Berkeley, CA, March, 1987).
2. S. Kappor and P.M. Vaidya, “Fast algorithms for convex quadratic programming and multicommodity flows,” in:Proceedings of the 18th Annual ACM Symposium on Theory of Computing (Berkeley, California, May 1986) pp. 147–159.
3. N. Karmarkar, “A new polynomial time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.
4. M. Kojima, S. Mizuno and A. Yoshise, “A polynomial-time algorithm for a class of linear complemtarity problems,”Mathematical Programming 44 (1989) 1–26, this issue.
5. M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, “Polynomial solvability of convex quadratic programming,”Doklady Akademiia Nauk SSSR 5 (1979) 1051–1053. [Translated in:Soviet Mathematics Doklady 20 (1979) 1108–1111.]