Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean
  Case   The Promise Constraint Satisfaction Problem (PCSP) is a recently introduced
vast generalization of the Constraint Satisfaction Problem (CSP). We
investigate the computational complexity of a class of PCSPs beyond the most
studied cases - approximation variants of satisfiability and graph coloring
problems. We give an almost complete classification for the class of PCSPs of
the form: given a 3-uniform hypergraph that has an admissible 2-coloring, find
an admissible 3-coloring, where admissibility is given by a ternary symmetric
relation. The only PCSP of this sort whose complexity is left open in this work
is a natural hypergraph coloring problem, where admissibility is given by the
relation "if two colors are equal, then the remaining one is higher."

19
The categories of this paper are: eess
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an