Constraint Satisfaction Problems with Advice
arXiv preprint arXiv:2403.02212, 2024•arxiv.org
… In this paper, we introduce two models for solving constraint satisfaction problems (CSPs)
with oracle advice. Suppose that we are given a constraint satisfaction problem with
predicates Ψ = {ψ1,...,ψm} and Boolean variables x1,...,xn.It will be convenient for us to
assume that value −1 represents false and 1 represents true. Let x∗ = (x∗1,...,x∗n) be a
fixed optimal solution, which we will refer to as the ground-truth solution. … In this paper, we
focus on two constraint satisfaction problems, Max Cut and Max 2-Lin, and show how to get …
with oracle advice. Suppose that we are given a constraint satisfaction problem with
predicates Ψ = {ψ1,...,ψm} and Boolean variables x1,...,xn.It will be convenient for us to
assume that value −1 represents false and 1 represents true. Let x∗ = (x∗1,...,x∗n) be a
fixed optimal solution, which we will refer to as the ground-truth solution. … In this paper, we
focus on two constraint satisfaction problems, Max Cut and Max 2-Lin, and show how to get …
We initiate the study of algorithms for constraint satisfaction problems with ML oracle advice. We introduce two models of advice and then design an approximation algorithm for Max Cut and Max 2-Lin in these models.
arxiv.org
以上显示的是最相近的搜索结果。 查看全部搜索结果