Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
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
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming