Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
M.F. Cowlishaw
IBM Systems Journal
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997