AI Chat AI Image Generator AI Video Text to Speech

Parameterized Complexity of CSP for Infinite Constraint Languages

06/30/2017

∙

by Ruhollah Majdoddin, et al.

∙

∙

We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the instance, and maximum number of occurrences of a variable in each constraint. A dichotomy theorem is already known for finite constraint languages with the weight parameter. We prove some general theorems that show, as new results, that some well-known problems are fixed-parameter tractable and some others are in W[1].

page 1

page 2

page 3

page 4

research

∙ 03/17/2018

A modifiction of the CSP algorithm for infinite languages

Constraint Satisfaction Problem on finite sets is known to be NP-complet...

0 Dmitriy Zhuk, et al. ∙

research

∙ 12/27/2018

Complexity of Reconfiguration Problems for Constraint Satisfaction

Constraint satisfaction problem (CSP) is a well-studied combinatorial se...

0 Tatsuhiko Hatanaka, et al. ∙

research

∙ 11/10/2017

On the hardness of losing weight

We study the complexity of local search for the Boolean constraint satis...

0 Andrei Krokhin, et al. ∙

research

∙ 11/18/2022

Computational Short Cuts in Infinite Domain Constraint Satisfaction

A backdoor in a finite-domain CSP instance is a set of variables where e...

0 Peter Jonsson, et al. ∙

research

∙ 04/14/2014

On Backdoors To Tractable Constraint Languages

In the context of CSPs, a strong backdoor is a subset of variables such ...

0 Clement Carbonnel, et al. ∙

research

∙ 11/20/2020

Fixed-Parameter Algorithms for Graph Constraint Logic

Non-deterministic constraint logic (NCL) is a simple model of computatio...

0 Tatsuhiko Hatanaka, et al. ∙

research

∙ 05/18/2023

Parameterized Complexity of Equality MinCSP

We study the parameterized complexity of MinCSP for so-called equality l...

0 George Osipov, et al. ∙