Ineffectiveness for Search and Undecidability of PCSP Meta-Problems 事件

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems arXiv:2504.04639v4 Announce Type: replace-cross Abstract: It is an open question whether the search and decision versions of promise CSPs are equivalent. Most known algorithms for PCSPs solve only their \emph{decision} variant, and it is unknown whether they can be adapted to solve \emph{search} as well. The main approaches, called BLP, AIP and BLP+AIP, handle a PCSP by finding a solution to a relaxation of some integer program