APA (7th ed.) Citation

Halemane, K. P. (2014). Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem.

Chicago Style (17th ed.) Citation

Halemane, Keshava Prasad. Unbelievable $O(L^{1.5})$ Worst Case Computational Complexity Achieved by $spdspds$ Algorithm for Linear Programming Problem. 2014.

MLA (9th ed.) Citation

Halemane, Keshava Prasad. Unbelievable $O(L^{1.5})$ Worst Case Computational Complexity Achieved by $spdspds$ Algorithm for Linear Programming Problem. 2014.