Approximate Constraint Satisfaction Requires Large LP Relaxations
published by James Lee
in 2013
in Informatics Engineering
and research's language is
English
Download
Abstract in English
We prove super-polynomial lower bounds on the size of linear programming relaxations for approximati
Download