A dichotomy theorem for nonuniform CSPs simplified

07/16/2020
by   Andrei A. Bulatov, et al.
0

In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the relations from G. The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language G the problem CSP(G) is either solvable in polynomial time or is NP-complete. It was proposed by Feder and Vardi in their seminal 1993 paper. In this paper we confirm the Dichotomy Conjecture.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/26/2020

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
07/23/2014

M-best solutions for a class of fuzzy constraint satisfaction problems

The article considers one of the possible generalizations of constraint ...
03/17/2018

A modifiction of the CSP algorithm for infinite languages

Constraint Satisfaction Problem on finite sets is known to be NP-complet...
05/19/2014

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a relational structure B is...
10/09/2018

Uniform CSP Parameterized by Solution Size is in W[1]

We show that the uniform Constraint Satisfaction Problem (CSP) parameter...
11/11/2021

Non-Uniform k-Center and Greedy Clustering

In the Non-Uniform k-Center problem, a generalization of the famous k-ce...
01/22/2019

Convergence of the Non-Uniform Physarum Dynamics

Let c ∈Z^m_> 0, A ∈Z^n× m, and b ∈Z^n. We show under fairly general cond...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.