Abstract
We show that for constraint satisfaction problems (CSPs), weakly exponential size linear programming relaxations are as powerful as the explicit linear program described by $n^{\Omega(1)}$-rounds o...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have