The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
In the field of constraint satisfaction problems (CSPs), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: “strict” and “weak,” and in the associated decision problem one must distinguish between being able to satisfy all the strict constraint...
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | Journal article |
| भाषा: | English |
| प्रकाशित: |
Society for Industrial and Applied Mathematics
2020
|