Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
Work
Year: 2017
Type: article
Abstract: We show that for constraint satisfaction problems (CSPs), sub-exponential size linear programming relaxations are as powerful as nΩ(1)-rounds of the Sherali-Adams linear programming hierarchy. As a co... more
Institutions Princeton University, University of California, Los Angeles, University of California, Berkeley
Cites: 16
Cited by: 41
Related to: 10
FWCI: 6.451
Citation percentile (by year/subfield): 95.42
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green