Sandwiches for Promise Constraint Satisfaction

17 Mar 2020 Deng Guofeng Sai Ezzeddine El Manders Trevor Mayr Peter Nakkirt Poramate Sparks Athena

Promise Constraint Satisfaction Problems (PCSP) were proposed recently by Brakensiek and Guruswami arXiv:1704.01937 as a framework to study approximations for Constraint Satisfaction Problems (CSP). Informally a PCSP asks to distinguish between whether a given instance of a CSP has a solution or not even a specified relaxation can be satisfied... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY