Elliot Linzer, M. Vetterli
Computing
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
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
Thomas M. Cheng
IT Professional