G. Ramalingam
Theoretical Computer Science
Paper
A note on approximate linear programming
Abstract
M. Serna recently proved that approximating linear programming is log-space complete for P. This note shows a direct reduction of the exact problem to Serna' approximate one. © 1992.
Related
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Thomas R. Puzak, A. Hartstein, et al.
CF 2007