Information Processing Letters

Paper

27 Apr 1992

A note on approximate linear programming

View publication

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

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

Paper

Routing and Wavelength Assignment in All-Optical Networks

Rajiv Ramaswami, Kumar N. Sivarajan

IEEE/ACM Transactions on Networking

Review

Data aggregation architectures for single-chip SDH/SONET framers

Rolf Clauberg

IBM J. Res. Dev

Conference paper

Discourse segmentation in aid of document summarization

B.K. Boguraev, Mary S. Neff

HICSS 2000

View all publications