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...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Brakensiek, J, Guruswami, V, Wrochna, M, Živný, S
Materyal Türü: Journal article
Dil:English
Baskı/Yayın Bilgisi: Society for Industrial and Applied Mathematics 2020