Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the hardness of losing weight   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.

12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
15
The categories of this paper are: nucl-ex
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas