par Braun, Gábor;Fiorini, Samuel 
;Pokutta, Sebastian;Steurer, David
Référence Annual Symposium on Foundations of Computer Science, page (480-489), 6375326
Publication Publié, 2012
;Pokutta, Sebastian;Steurer, DavidRéférence Annual Symposium on Foundations of Computer Science, page (480-489), 6375326
Publication Publié, 2012
Article révisé par les pairs
| Résumé : | We develop a framework for proving approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that quadratic approximations for CLIQUE require linear programs of exponential size. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem) Moreover, we establish a similar result for approximations of semi definite programs by linear programs. Our main technical ingredient is a quantitative improvement of Razborov's rectangle corruption lemma (1992) for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjoint ness matrix. © 2012 IEEE. |
