### 13 papers:

- ICALP-v1-2015-KhotS #approximate #using
- Approximating CSPs Using LP Relaxation (SK, RS), pp. 822–833.
- ICALP-v1-2015-ThapperZ
- Sherali-Adams Relaxations for Valued CSPs (JT, SZ), pp. 1058–1069.
- CSL-2015-DawarW #finite
- A Definability Dichotomy for Finite Valued CSPs (AD, PW), pp. 60–77.
- STOC-2013-ThapperZ #complexity
- The complexity of finite-valued CSPs (JT, SZ), pp. 695–704.
- ICALP-v1-2013-BhattacharyyaY #algebra
- An Algebraic Characterization of Testable Boolean CSPs (AB, YY), pp. 123–134.
- ICALP-v1-2013-Kolmogorov #linear #power of #programming
- The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization (VK), pp. 625–636.
- SAC-2013-LikitvivatanavongY #set
- Many-to-many interchangeable sets of values in CSPs (CL, RHCY), pp. 86–91.
- CSL-2013-BulatovDT #approximate #complexity
- Descriptive complexity of approximate counting CSPs (AAB, VD, MT), pp. 149–164.
- ICALP-v1-2012-AchlioptasM #bound #random #satisfiability
- Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.
- STOC-2009-ODonnellW #satisfiability
- Conditional hardness for satisfiable 3-CSPs (RO, YW), pp. 493–502.
- SAT-2006-Bacchus #named #satisfiability
- CSPs: Adding Structure to SAT (FB), p. 10.
- SEKE-2004-MouhoubSS
- Formal Description Techniques for CSPs and TCSPs (MM, SS, AS), pp. 406–410.
- ICLP-2002-FerrandL #approximate #finite #logic programming #reduction
- A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs (GF, AL), pp. 478–479.