Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Parameterized Complexity of CSP for Infinite Constraint Languages   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].

26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys