On the hardness of losing weight

11/10/2017
by   Andrei Krokhin, et al.
0

We study the complexity of local search for the Boolean constraint satisfaction problem (CSP), in the following form: given a CSP instance, that is, a collection of constraints, and a solution to it, the question is whether there is a better (lighter, i.e., having strictly less Hamming weight) solution within a given distance from the initial solution. We classify the complexity, both classical and parameterized, of such problems by a Schaefer-style dichotomy result, that is, with a restricted set of allowed types of constraints. Our results show that there is a considerable amount of such problems that are NP-hard, but fixed-parameter tractable when parameterized by the distance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2017

Parameterized Complexity of CSP for Infinite Constraint Languages

We study parameterized Constraint Satisfaction Problem for infinite cons...
research
11/10/2022

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

We study a parameterized version of the local Hamiltonian problem, calle...
research
04/27/2023

On Solution Discovery via Reconfiguration

The dynamics of real-world applications and systems require efficient me...
research
10/09/2018

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

We show that the uniform Constraint Satisfaction Problem (CSP) parameter...
research
04/26/2021

Beyond PCSP(1-in-3,NAE)

The promise constraint satisfaction problem (PCSP) is a recently introdu...
research
05/23/2023

Parameterized Complexity Classification for Interval Constraints

Constraint satisfaction problems form a nicely behaved class of problems...
research
02/13/2019

CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

We study the complexity of Boolean constraint satisfaction problems (CSP...

Please sign up or login with your details

Forgot password? Click here to reset